Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems (Q5501871): Difference between revisions

Revision as of 16:10, 10 July 2024

scientific article; zbMATH DE number 6472666

Language	Label	Description	Also known as
English	Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems	scientific article; zbMATH DE number 6472666

Statements

instance of

scholarly article

0 references

title

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

0 references

0 references

0 references

0 references

RAIRO - Operations Research

0 references

publication date

14 August 2015

0 references

full work available at URL

https://hal.laas.fr/hal-01875890/file/Article_2014-110.pdf

0 references

zbMATH Keywords

multi-objective optimization

0 references

bound sets

0 references

combinatorial optimization

0 references

column generation

0 references

MaRDI profile type

Publication

0 references

cites work

Bicriteria Transportation Problem

0 references

An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits

0 references

Accelerated label setting algorithms for the elementary resource constrained shortest path problem

0 references

The median tour and maximal covering tour problems: Formulations and heuristics

0 references

A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows

0 references

Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW

0 references

Bound sets for biobjective combinatorial optimization problems

0 references

An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

0 references

The Covering Tour Problem

0 references

Heuristics for the multi-vehicle covering tour problem

0 references

The bi-objective covering tour problem

0 references

New dynamic programming algorithms for the resource constrained elementary shortest path problem

0 references

A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem

0 references

Q4889471

0 references

Implementing Mixed Integer Column Generation

0 references

Multicriteria integer programming: A (hybrid) dynamic programming recursive approach

0 references

Identifiers

zbMATH Open document ID

1327.90265

0 references

DOI

10.1051/ro/2014054

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5501871

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