Knapsack problems—An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems
After the seminal books by Martello and Toth (1990) and Kellerer, Pferschy, and Pisinger
(2004), knapsack problems became a classical and rich research area in combinatorial …
(2004), knapsack problems became a classical and rich research area in combinatorial …
Multi-objective branch and bound
A Przybylski, X Gandibleux - European Journal of Operational Research, 2017 - Elsevier
Branch and bound is a well-known generic method for computing an optimal solution of a
single-objective optimization problem. Based on the idea “divide to conquer”, it consists in …
single-objective optimization problem. Based on the idea “divide to conquer”, it consists in …
[PDF][PDF] Output-sensitive complexity of multiobjective combinatorial optimization with an application to the multiobjective shortest path problem
FK Bökler - 2018 - tcs.uni-osnabrueck.de
In this thesis, we are concerned with multiobjective combinatorial optimization (MOCO)
problems. We attempt to fill the gap between theory and practice, which comes from the lack …
problems. We attempt to fill the gap between theory and practice, which comes from the lack …
Output‐sensitive complexity of multiobjective combinatorial optimization
We study output‐sensitive algorithms and complexity for multiobjective combinatorial
optimization problems. In this computational complexity framework, an algorithm for a …
optimization problems. In this computational complexity framework, an algorithm for a …
On the strength of Lagrangian duality in multiobjective integer programming
This paper investigates the potential of Lagrangian relaxations to generate quality bounds
on non-dominated images of multiobjective integer programs (MOIPs). Under some …
on non-dominated images of multiobjective integer programs (MOIPs). Under some …
On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
SM Stefanov - European journal of operational research, 2015 - Elsevier
A minimization problem with a convex separable objective function subject to linear equality
constraints and box constraints (bounds on the variables) is considered. Necessary and …
constraints and box constraints (bounds on the variables) is considered. Necessary and …
A Lagrangian bounding and heuristic principle for bi-objective discrete optimization
T Larsson, NH Quttineh, I Åkerholm - Operational Research, 2024 - Springer
Lagrangian relaxation is a common and often successful way to approach computationally
challenging single-objective discrete optimization problems with complicating side …
challenging single-objective discrete optimization problems with complicating side …
[PDF][PDF] Optimization methods for knapsack and tool switching problems.
A Locatelli - 4OR, 2023 - iris.unimore.it
Knapsack problems are a highly active research area in combinatorial optimization.
Although, the knapsack problem has been known since over a century, see Mathews [368] …
Although, the knapsack problem has been known since over a century, see Mathews [368] …
Approximating the Pareto frontier for bi-objective preventive maintenance and workshop scheduling: A Lagrangean lower bounding methodology for evaluating …
Effective planning of preventive maintenance plays an important role in maximizing the
operational readiness of any industrial system. We consider an operating system and a …
operational readiness of any industrial system. We consider an operating system and a …
Relaxations and duality for multiobjective integer programming
Multiobjective integer programs (MOIPs) simultaneously optimize multiple objective
functions over a set of linear constraints and integer variables. In this paper, we present …
functions over a set of linear constraints and integer variables. In this paper, we present …