ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design

DOI10.1016/j.cor.2016.02.006zbMath1349.90649OpenAlexW2288235575WikidataQ57705357 ScholiaQ57705357MaRDI QIDQ342390

Axel Werner, Ivana Ljubić, Markus Sinnl, Markus Leitner

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.02.006

zbMATH Keywords

branch-and-cutneighborhood searchlocal branching\(k\)-architecture connected facility locationbi-objective connected facility locationILP heuristics

Mathematics Subject Classification ID

Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (9)

Exact algorithms for bi-objective ring tree problems with reliability measures ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ An exact algorithm for biobjective integer programming problems ⋮ A two-stage approach for bi-objective integer linear programming ⋮ A matheuristic for tri-objective binary integer linear programming ⋮ Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ The incremental connected facility location problem ⋮ Bi-objective facility location under uncertainty with an application in last-mile disaster relief

Uses Software

• SteinLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
• Multi-directional local search
• Proximity search for 0--1 mixed-integer convex programming
• Branch-and-cut-and-price for capacitated connected facility location
• MIP models for connected facility location: a theoretical and computational study
• A review of interactive methods for multiobjective integer and mixed-integer programming
• 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
• Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
• An algorithm for the bi-criterion integer programming problem
• On implementing the push-relabel method for the maximum flow problem
• Local branching
• An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
• Thinning out Steiner trees: a node-based model for uniform edge costs
• Fathoming rules for biobjective mixed integer linear programs: review and extensions
• Exploring relaxation induced neighborhoods to improve MIP solutions
• The biobjective travelling purchaser problem
• Variable and large neighborhood search to solve the multiobjective set covering problem
• Two phase algorithms for the bi-objective assignment problem
• Towards optimizing the deployment of optical access networks
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
• A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method
• A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem
• A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem
• An Algorithm for Multiobjective Zero-One Linear Programming
• An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
• Solving Steiner tree problems in graphs to optimality

This page was built for publication: ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design