Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
From MaRDI portal
Publication:1887952
DOI10.1016/S0377-2217(03)00420-XzbMath1065.90056MaRDI QIDQ1887952
Publication date: 22 November 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Integer programmingKnapsack problemMultiple objective programmingLP-based heuristic\(\varepsilon\)-Nondominated solution
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Dynamic programming algorithms for the bi-objective integer knapsack problem, The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem, A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem, Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms, The multiobjective multidimensional knapsack problem: a survey and a new approach, A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A multiple objective interactive Lagrangean relaxation approach
- A class of practical interactive branch and bound algorithms for multicriteria integer programming
- Zero-one programming with multiple criteria
- An algorithm for the multiple objective integer linear programming problem
- Interactive analysis of multiple-criteria project scheduling problems
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- An interactive heuristic method for multi-objective combinatorial optimization
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
- Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
- Solving zero-one multiple objective programs through implicit enumeration
- A property of assignment type mixed integer linear programming problems
- A survey and annotated bibliography of multiobjective combinatorial optimization
- A comparison of neighborhood search techniques for multi-objective combinatorial problems
- Using metaheuristics in multiobjective resource constrained project scheduling
- Performance of the MOSA method for the bicriteria assignment problem
- A simulated annealing approach to bicriteria scheduling problems on a single machine
- A Survey of Multiple Criteria Integer Programming Methods
- An Algorithm for Multiobjective Zero-One Linear Programming
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
- A Bibliography on the Applications of Mathematical Programming Multiple-objective Methods
- An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- Multiobjective Metaheuristics for the Bus Driver Scheduling Problem
- Multi‐objective combinatorial optimization problems: A survey
- MOSA method: a tool for solving multiobjective combinatorial optimization problems
- Discrete-Variable Extremum Problems
