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

DOI10.1051/RO/2014054zbMATH Open1327.90265OpenAlexW2062573813MaRDI QIDQ5501871FDOQ5501871

Authors: Boadu M. Sarpong, Christian Artigues, Nicolas Jozefowiez 

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

Recommendations

• Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective
• Column generation for bi-objective vehicle routing problems with a MIN-MAX objective
• An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems
• A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem
• An exact column generation-based algorithm for bi-objective vehicle routing problems

zbMATH Keywords

combinatorial optimizationmulti-objective optimizationcolumn generationbound sets

Mathematics Subject Classification ID

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

Cites Work

• A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Implementing Mixed Integer Column Generation
• 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
• Bicriteria Transportation Problem
• Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
• The Covering Tour Problem
• Bound sets for biobjective combinatorial optimization problems
• Title not available (Why is that?)
• The bi-objective covering tour problem

Cited In (4)

• Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective
• Title not available (Why is that?)
• Column generation for bi-objective vehicle routing problems with a MIN-MAX objective
• Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes

This page was built for publication: Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems

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