A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming
From MaRDI portal
Publication:5137441
DOI10.1287/ijoc.2018.0814OpenAlexW2907415308WikidataQ128638793 ScholiaQ128638793MaRDI QIDQ5137441
Publication date: 2 December 2020
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/f8736e0c852beba032a309802a0a42aa68a43215
local searchparallelizationfeasibility pumpbi-objective integer linear programmingperpendicular search method
Related Items (3)
A matheuristic for tri-objective binary integer linear programming ⋮ Ten years of feasibility pump, and counting ⋮ FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
Uses Software
Cites Work
- The \(L\)-shape search method for triobjective integer programming
- Heuristic approaches for biobjective mixed 0-1 integer linear programming problems
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
- Multi-directional local search
- Survey of multi-objective optimization methods for engineering
- Boosting the feasibility pump
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- An algorithm for the bi-criterion integer programming problem
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
- 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
- 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
- Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem
- 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
- Computing in Operations Research Using Julia
- The Multiobjective Traveling Salesman Problem: A Survey and a New Approach
- Bicriteria Transportation Problem
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- Evolutionary Algorithms for Solving Multi-Objective Problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming
