Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic

DOI10.1016/S0377-2217(03)00420-XMaRDI QIDQ1887952zbMATH OpenFDO

Authors Cai Wen Zhang, Hoon Liong Ong

Publication date 22 November 2004

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL http://scholarbank.nus.edu.sg/handle/10635/63326

zbMATH Keywords

\(\varepsilon\)-Nondominated solutionInteger programmingKnapsack problemLP-based heuristicMultiple objective programming

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Exact algorithm for bi-objective 0-1 knapsack problem
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• Solving efficiently the 0-1 multi-objective knapsack problem
• Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
• Quick evaluation of the efficient solution set for the biobjective knapsack problem

Cites work

• A Bibliography on the Applications of Mathematical Programming Multiple-objective Methods
• A class of practical interactive branch and bound algorithms for multicriteria integer programming
• A comparison of neighborhood search techniques for multi-objective combinatorial problems
• A multiple objective interactive Lagrangean relaxation approach
• A property of assignment type mixed integer linear programming problems
• A simulated annealing approach to bicriteria scheduling problems on a single machine
• A survey and annotated bibliography of multiobjective combinatorial optimization
• A Survey of Multiple Criteria Integer Programming Methods
• An Algorithm for Multiobjective Zero-One Linear Programming
• An algorithm for the multiple objective integer linear programming problem
• An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
• An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
• An interactive heuristic method for multi-objective combinatorial optimization
• An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
• An Overview of Techniques for Solving Multiobjective Mathematical Programs
• Discrete-variable extremum problems
• scientific article; zbMATH DE number 3945836 (Why is no real title available?)
• scientific article; zbMATH DE number 3978851 (Why is no real title available?)
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 40470 (Why is no real title available?)
• scientific article; zbMATH DE number 3566554 (Why is no real title available?)
• scientific article; zbMATH DE number 3999655 (Why is no real title available?)
• scientific article; zbMATH DE number 915988 (Why is no real title available?)
• Interactive analysis of multiple-criteria project scheduling problems
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• Multiobjective Metaheuristics for the Bus Driver Scheduling Problem
• Multi‐objective combinatorial optimization problems: A survey
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• Performance of the MOSA method for the bicriteria assignment problem
• Solving zero-one multiple objective programs through implicit enumeration
• Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• Using metaheuristics in multiobjective resource constrained project scheduling
• Zero-one programming with multiple criteria

Cited in

(10)

• Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
• Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
• A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
• Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
• The multiobjective multidimensional knapsack problem: a survey and a new approach
• Dynamic programming algorithms for the bi-objective integer knapsack problem
• A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem
• Quick evaluation of the efficient solution set for the biobjective knapsack problem
• The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem
• Exact algorithm for bi-objective 0-1 knapsack problem

This page was built for publication: Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1887952)