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

DOI10.1007/s13675-017-0090-6zbMath1400.90224OpenAlexW2766274185MaRDI QIDQ1616824

Christian Artigues, Nicolas Jozefowiez, Boadu M. Sarpong

Publication date: 7 November 2018

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13675-017-0090-6

zbMATH Keywords

multi-objective optimizationcolumn generationbound setsvehicle routing problems

Mathematics Subject Classification ID

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

Related Items (1)

Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems

Uses Software

• NBI

Cites Work

• Multi-objective and multi-constrained non-additive shortest path problems
• 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
• An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
• 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
• Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
• The Covering Tour Problem
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Column Generation for Bi-Objective Vehicle Routing Problems with a Min-Max Objective
• Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
• Unnamed Item

This page was built for publication: Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective