A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming
DOI10.1287/IJOC.2018.0814OpenAlexW2907415308WikidataQ128638793 ScholiaQ128638793MaRDI QIDQ5137441FDOQ5137441
Authors: Aritra Pal, Hadi Charkhgard 
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
Recommendations
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
- Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
- An exact algorithm for biobjective mixed integer linear programming problems
- Heuristic approaches for biobjective mixed 0-1 integer linear programming problems
- An improved algorithm for solving biobjective integer programs
local searchfeasibility pumpparallelizationbi-objective integer linear programmingperpendicular search method
Cites Work
- Multi-objective integer programming: an improved recursive algorithm
- Improving the feasibility pump
- The feasibility pump
- Survey of multi-objective optimization methods for engineering
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
- The multiobjective traveling salesman problem: A survey and a new approach
- Evolutionary Algorithms for Solving Multi-Objective Problems
- 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
- 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
- A criterion space search algorithm for biobjective integer programming: the balanced box method
- The \(L\)-shape search method for triobjective integer programming
- Bicriteria Transportation Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- On local optima in multiobjective combinatorial optimization problems
- Heuristic approaches for biobjective mixed 0-1 integer linear programming problems
- Multi-directional local search
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method
- Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem
- Computing in operations research using Julia
- Boosting the feasibility pump
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
- Finding nadir points in multi-objective integer programs
Cited In (4)
Uses Software
This page was built for publication: A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5137441)
