A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem

DOI10.1080/00207160701690433zbMath1165.65358MaRDI QIDQ3630434

Takeo Yamada, Seiji Kataoka, Fumiaki Taniguchi

Publication date: 29 May 2009

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.informaworld.com/smpp/./content~db=all~content=a793318364

zbMATH Keywords

branch-and-bound algorithm; numerical examples; knapsack problem; heuristic algorithm; bi-objective combinatorial optimization; pegging test

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C29: Multi-objective and goal programming

90C27: Combinatorial optimization

Related Items

Hybrid approaches for the two-scenario max-min knapsack problem

Cites Work

• Unnamed Item
• Unnamed Item
• A note on the max-min 0-1 knapsack problem
• Robust discrete optimization and its applications
• Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
• A pegging approach to the precedence-constrained knapsack problem
• Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
• An Algorithm for Large Zero-One Knapsack Problems
• Reduction Algorithm for Zero-One Single Knapsack Problems
• Resolution of the 0–1 knapsack problem: Comparison of methods
• Surrogate Constraint Duality in Mathematical Programming
• Parametric Solution for Linear Bicriteria Knapsack Models
• On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications