An algorithm for the bi-criterion integer programming problem
From MaRDI portal
Publication:1075952
DOI10.1016/0377-2217(86)90093-7zbMath0592.90085OpenAlexW2094869570MaRDI QIDQ1075952
L. Lemonidis, D. J. Elzinga, L. G. Chalmet
Publication date: 1986
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(86)90093-7
computational resultsmulti-criterion optimizationnondominated solutionsweighting methodbi-criterion integer programming
Numerical mathematical programming methods (65K05) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Management decision making, including multiple objectives (90B50)
Related Items
An algorithm for the bi-criterion integer programming problem ⋮ A class of practical interactive branch and bound algorithms for multicriteria integer programming ⋮ A bi-objective approach to discrete cost-bottleneck location problems ⋮ The \(L\)-shape search method for triobjective integer programming ⋮ An interactive algorithm for solving multiple objective integer linear programming problems ⋮ Unnamed Item ⋮ An improved algorithm for solving biobjective integer programs ⋮ Algorithm robust for the bicriteria discrete optimization problem ⋮ On the representation of the search region in multi-objective optimization ⋮ Nondominated Nash points: application of biobjective mixed integer programming ⋮ ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design ⋮ A review of interactive methods for multiobjective integer and mixed-integer programming ⋮ Multiobjective modelling and analysis of process planning in a manufacturing system ⋮ Balance in resource allocation problems: a changing reference approach ⋮ An exact algorithm for biobjective integer programming problems ⋮ A two-stage approach for bi-objective integer linear programming ⋮ Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests ⋮ An exact criterion space search algorithm for a bi-objective blood collection problem ⋮ Modeling target volume flows in forest harvest scheduling subject to maximum area restrictions ⋮ A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming ⋮ Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets ⋮ An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing ⋮ A survey of recent developments in multiobjective optimization ⋮ Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems ⋮ Efficient computation of the search region in multi-objective optimization ⋮ A memetic algorithm for multi-objective dynamic location problems ⋮ Bi-objective project portfolio selection and staff assignment under uncertainty ⋮ Bicriteria network flow problems: Integer case ⋮ An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems ⋮ A provably convergent heuristic for stochastic bicriteria integer programming ⋮ A multi-objective Monte Carlo tree search for forest harvest scheduling ⋮ Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming ⋮ A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method ⋮ Multi-criteria location planning for public facilities in tsunami-prone coastal areas ⋮ A reduction algorithm for integer multiple objective linear programs ⋮ A method for finding the set of non-dominated vectors for multiple objective integer linear programs ⋮ FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming ⋮ A branch and bound algorithm for mixed zero-one multiple objective linear programming ⋮ A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems ⋮ An interactive procedure for multiple objective integer linear programming problems ⋮ New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach
Cites Work
- An algorithm for the bi-criterion integer programming problem
- An algorithm for the multiple objective integer linear programming problem
- Proper efficiency and the theory of vector maximization
- A combined approach to solve binary multicriteria problems
- Theory and algorithms for linear multiple objective programs with zero–one variables
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
- An Interactive Programming Method for Solving the Multiple Criteria Problem
- Linear multiple objective programs with zero–one variables
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
