Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective
type: Item
instance of: scholarly article
title: Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective
zbMATH Open document ID: 1400.90224
author: Christian Artigues
author: Nicolas Jozefowiez
author: Boadu M. Sarpong
published in: EURO Journal on Computational Optimization
publication date: 2018-11-07T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6974524
zbMATH Keywords: column generation
zbMATH Keywords: multi-objective optimization
zbMATH Keywords: bound sets
zbMATH Keywords: vehicle routing problems
describes a project that uses: NBI
MaRDI profile type: Publication
full work available at URL: s13675-017-0090-6
OpenAlex ID: W2766274185
cites work: An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
cites work: Accelerated label setting algorithms for the elementary resource constrained shortest path problem
cites work: The median tour and maximal covering tour problems: Formulations and heuristics
cites work: Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems
cites work: Bound sets for biobjective combinatorial optimization problems
cites work: An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
cites work: The Covering Tour Problem
cites work: An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
cites work: Heuristics for the multi-vehicle covering tour problem
cites work: On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
cites work: The bi-objective covering tour problem
cites work: Multi-objective and multi-constrained non-additive shortest path problems
cites work: New dynamic programming algorithms for the resource constrained elementary shortest path problem
cites work: Column Generation for Bi-Objective Vehicle Routing Problems with a Min-Max Objective
cites work: Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems
cites work: A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
cites work: Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
DOI: 10.1007/S13675-017-0090-6
description: scientific article; zbMATH DE number 6974524