Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems

DOI10.1051/ro/2014054zbMath1327.90265OpenAlexW2062573813MaRDI QIDQ5501871

Nicolas Jozefowiez, Boadu M. Sarpong, Christian Artigues

Publication date: 14 August 2015

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://hal.laas.fr/hal-01875890/file/Article_2014-110.pdf

zbMATH Keywords

multi-objective optimizationcolumn generationcombinatorial optimizationbound sets

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items

Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective

Cites Work

• Unnamed Item
• The bi-objective covering tour problem
• Bound sets for biobjective combinatorial optimization problems
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• The median tour and maximal covering tour problems: Formulations and heuristics
• Heuristics for the multi-vehicle covering tour problem
• Accelerated label setting algorithms for the elementary resource constrained shortest path problem
• A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
• Bicriteria Transportation Problem
• Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• The Covering Tour Problem
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Implementing Mixed Integer Column Generation