A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem
From MaRDI portal
Publication:2815467
Recommendations
- Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
- A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
- An exact -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- Multi-objective branch and bound
- The multiobjective traveling salesman problem: A survey and a new approach
Cites work
- scientific article; zbMATH DE number 4174360 (Why is no real title available?)
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- scientific article; zbMATH DE number 2046100 (Why is no real title available?)
- scientific article; zbMATH DE number 2144390 (Why is no real title available?)
- scientific article; zbMATH DE number 2160609 (Why is no real title available?)
- scientific article; zbMATH DE number 915988 (Why is no real title available?)
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants
- A level set method for multiobjective combinatorial optimization: application to the quadratic assignment problem
- A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
- A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- An exact -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- Bound sets for biobjective combinatorial optimization problems
- Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem
- Multi-objective meta-heuristics for the traveling salesman problem with profits
- Multi-objective optimization using evolutionary algorithms
- Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
- Tabu search for a multi-objective routing problem
- The Colorful Traveling Salesman Problem
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- The bi-objective covering tour problem
- Two phase algorithms for the bi-objective assignment problem
- K-PPM: a new exact method to solve multi-objective combinatorial optimization problems
Cited in
(21)- Decomposition of loosely coupled integer programs: a multiobjective perspective
- Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
- Relaxations and duality for multiobjective integer programming
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
- The multi-objective generalized consistent vehicle routing problem
- Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
- A hybrid approach for biobjective optimization
- A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods
- Rapid transit network design for optimal cost and origin-destination demand capture
- Network Models for Multiobjective Discrete Optimization
- Adaptation of a branching algorithm to solve the multi-objective Hamiltonian cycle problem
- Split algorithms for multiobjective integer programming problems
- Fathoming rules for biobjective mixed integer linear programs: review and extensions
- ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design
- Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs
- A multi-objective, hub-and-spoke model to design and manage biofuel supply chains
- Multi-objective branch and bound
- Branch-and-bound for bi-objective integer programming
- Disjunctive Programming for Multiobjective Discrete Optimisation
- A criterion space search algorithm for biobjective integer programming: the balanced box method
This page was built for publication: A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815467)
