A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem (Q2815467): Difference between revisions

Revision as of 05:39, 12 July 2024

scientific article

Language	Label	Description	Also known as
English	A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem	scientific article

Statements

instance of

scholarly article

0 references

title

A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem (English)

0 references

0 references

0 references

0 references

INFORMS Journal on Computing

0 references

publication date

29 June 2016

0 references

zbMATH Keywords

decision analysis

0 references

multiple criteria

0 references

programming

0 references

integer

0 references

algorithm

0 references

cutting plane

0 references

networks-graphs

0 references

traveling salesman

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1287/ijoc.1110.0476

0 references

cites work

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

0 references

Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem

0 references

0 references

0 references

0 references

0 references

0 references

\(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems

0 references

Q4670576

0 references

Bound sets for biobjective combinatorial optimization problems

0 references

Q3412065

0 references

Multi-objective meta-heuristics for the traveling salesman problem with profits

0 references

A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants

0 references

The bi-objective covering tour problem

0 references

The Ring Star Problem: Polyhedral analysis and exact algorithm

0 references

Parallel partitioning method (PPM): A new exact method to solve bi-objective problems

0 references

A branch and bound algorithm for mixed zero-one multiple objective linear programming

0 references

Tabu search for a multi-objective routing problem

0 references

Two phase algorithms for the bi-objective assignment problem

0 references

A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme

0 references

A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives

0 references

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

0 references

Q4889471

0 references

The Colorful Traveling Salesman Problem

0 references

Identifiers

zbMATH Open document ID

1462.90120

0 references

DOI

10.1287/ijoc.1110.0476

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2815467

@@ Property / author @@
-Frédéric Semet
@@ Property / author: Frédéric Semet / rank @@
-Normal rank
@@ Property / author @@
+Frédéric Semet
@@ Property / author: Frédéric Semet / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1287/ijoc.1110.0476
+Normal rank
@@ Property / OpenAlex ID @@
+W2101083806
@@ Property / OpenAlex ID: W2101083806 / 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 @@
+Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem
+Normal rank
@@ Property / cites work @@
+Q3760254
@@ Property / cites work: Q3760254 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4451071
@@ Property / cites work: Q4451071 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4656643
@@ Property / cites work: Q4656643 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3198897
@@ Property / cites work: Q3198897 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2723294
@@ Property / cites work: Q2723294 / rank @@
+Normal rank
@@ Property / cites work @@
+\(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+Q4670576
@@ Property / cites work: Q4670576 / rank @@
+Normal rank
@@ Property / cites work @@
+Bound sets for biobjective combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+Q3412065
@@ Property / cites work: Q3412065 / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-objective meta-heuristics for the traveling salesman problem with profits
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants
+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 @@
+The Ring Star Problem: Polyhedral analysis and exact algorithm
+Normal rank
@@ Property / cites work @@
+Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for mixed zero-one multiple objective linear programming
+Normal rank
@@ Property / cites work @@
+Tabu search for a multi-objective routing problem
@@ Property / cites work: Tabu search for a multi-objective routing problem / rank @@
+Normal rank
@@ Property / cites work @@
+Two phase algorithms for the bi-objective assignment problem
+Normal rank
@@ Property / cites work @@
+A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
+Normal rank
@@ Property / cites work @@
+A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
+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 @@
+The Colorful Traveling Salesman Problem
@@ Property / cites work: The Colorful Traveling Salesman Problem / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2815467