A hybrid approach for biobjective optimization
From MaRDI portal
Publication:1662163
DOI10.1016/j.disopt.2018.02.001zbMath1506.90241OpenAlexW2793224753MaRDI QIDQ1662163
Publication date: 17 August 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://pure.au.dk/ws/files/164642330/Andersen_2018_A_hybrid_approach_for_biobjective_optimization.pdf
Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)
Related Items (7)
Network Models for Multiobjective Discrete Optimization ⋮ A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach ⋮ An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems ⋮ Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs ⋮ Branch-and-bound and objective branching with three or more objectives ⋮ Twenty years of continuous multiobjective optimization in the twenty-first century ⋮ Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
- Heuristic approaches for biobjective mixed 0-1 integer linear programming problems
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Solution of large-scale symmetric travelling salesman problems
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
- A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- Two-phase Pareto local search for the biobjective traveling salesman problem
- A two-phase algorithm for the biobjective integer minimum cost flow problem
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Cutting planes for integer programs with general integer variables
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- Performance evaluation of acceptance probability functions for multi-objective SA
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
- Proper balance between search towards and along Pareto front: biobjective TSP case study
- Finding representative systems for discrete bicriterion optimization problems
- Use of substitute scalarizing functions to guide a local search based heuristic: the case of moTSP
- A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method
- A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem
- A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Diversity Maximization Approach for Multiobjective Optimization
- The Multiobjective Traveling Salesman Problem: A Survey and a New Approach
- On the Performance of Local Search for the Biobjective Traveling Salesman Problem
- TSPLIB—A Traveling Salesman Problem Library
- A hybrid dynamic programming approach to the biobjective binary knapsack problem
- Multicriteria Optimization
- Solution of a Large-Scale Traveling-Salesman Problem
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- Genetic local search for multi-objective combinatorial optimization
This page was built for publication: A hybrid approach for biobjective optimization
