FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
From MaRDI portal
Publication:2329715
DOI10.1016/j.cor.2019.07.018zbMath1458.90580OpenAlexW2964649824MaRDI QIDQ2329715
Publication date: 18 October 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2019.07.018
local searchparallelizationfeasibility pumplocal branchingmulti-objective mixed integer linear programming
Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
Addendum to: ``FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming ⋮ A matheuristic for tri-objective binary integer linear programming ⋮ Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs ⋮ FPBH.jl ⋮ Bi-objective facility location under uncertainty with an application in last-mile disaster relief
Uses Software
Cites Work
- The \(L\)-shape search method for triobjective integer programming
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
- Multi-directional local search
- An exact algorithm for biobjective mixed integer linear programming problems
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- Boosting the feasibility pump
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- Approximating the volume of unions and intersections of high-dimensional geometric objects
- Feasibility pump 2.0
- An algorithm for the bi-criterion integer programming problem
- Local branching
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Efficient computation of the search region in multi-objective optimization
- Multi-objective branch and bound
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
- Multi-objective integer programming: an improved recursive algorithm
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- Ten years of feasibility pump, and counting
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- Finding nadir points in multi-objective integer programs
- On local optima in multiobjective combinatorial optimization problems
- Improving the feasibility pump
- The feasibility pump
- A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method
- A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method
- A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
- An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
- Computing in Operations Research Using Julia
- The Multiobjective Traveling Salesman Problem: A Survey and a New Approach
- Bicriteria Transportation Problem
- A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming
- Multicriteria Optimization
- Evolutionary Algorithms for Solving Multi-Objective Problems
- JuMP: A Modeling Language for Mathematical Optimization
This page was built for publication: FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
