Heuristic approaches for biobjective mixed 0-1 integer linear programming problems
From MaRDI portal
Publication:319659
DOI10.1016/j.ejor.2015.04.010zbMath1346.90619OpenAlexW2107646370MaRDI QIDQ319659
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.04.010
multiobjective programmingvariable neighborhood searchbiobjective mixed 0-1 integer linear programminglocal branching
Integer programming (90C10) Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)
Related Items
Advancing local search approximations for multiobjective combinatorial optimization problems, Design of a heuristic algorithm for the generalized multi-objective set covering problem, An exact algorithm for biobjective mixed integer linear programming problems, A hybrid approach for biobjective optimization, Branch-and-Bound for Biobjective Mixed-Integer Linear Programming, A matheuristic for tri-objective binary integer linear programming, A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming, Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint, A multiobjective hub-airport location problem for an airline network design, An algorithm for approximating the Pareto set of the multiobjective set covering problem, The search-and-remove algorithm for biobjective mixed-integer linear programming problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- Finding the upper envelope of n line segments in O(n log n) time
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Multiobjective programming and planning
- Linear multiobjective programming
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- On spanning tree problems with multiple objectives
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Local branching
- Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
- Fathoming rules for biobjective mixed integer linear programs: review and extensions
- A bicriteria approach to the two-machine flow shop scheduling problem
- A supply chain design problem with facility location and bi-objective transportation choices
- Variable neighborhood search and local branching
- Proper efficiency and the theory of vector maximization
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
- A memetic algorithm for bi-objective integrated forward/reverse logistics network design
- Bicriteria p-Hub Location Problems and Evolutionary Algorithms
- Mixed Integer Programming Computation
- Bicriteria Transportation Problem
- Linear Multiparametric Programming by Multicriteria Simplex Method
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- Error Detecting and Error Correcting Codes
- Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
- Multicriteria Optimization
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- Variable neighborhood search: Principles and applications
