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

DOI10.1080/00207160701690433zbMath1165.65358OpenAlexW2035820111MaRDI QIDQ3630434

Fumiaki Taniguchi, Seiji Kataoka, Takeo Yamada

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 algorithmnumerical examplesknapsack problemheuristic algorithmbi-objective combinatorial optimizationpegging test

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (3)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Hybrid approaches for the two-scenario max-min knapsack problem ⋮ Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound

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

This page was built for publication: A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem