An algorithm for the bi-criterion integer programming problem

DOI10.1016/0377-2217(86)90093-7zbMATH Open0592.90085OpenAlexW2094869570MaRDI QIDQ1075952FDOQ1075952

Authors: L. G. Chalmet, L. Lemonidis, D. J. Elzinga 

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

Recommendations

• Algorithms for nonlinear integer bicriterion problems
• scientific article; zbMATH DE number 4049388
• scientific article; zbMATH DE number 3873105
• Three algorithms for bicriteria integer linear programs
• An improved algorithm for solving biobjective integer programs

zbMATH Keywords

computational resultsnondominated solutionsmulti-criterion optimizationweighting methodbi-criterion integer programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Management decision making, including multiple objectives (90B50) Linear programming (90C05) Sensitivity, stability, parametric optimization (90C31) Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• Proper efficiency and the theory of vector maximization
• An algorithm for the bi-criterion integer programming problem
• An algorithm for the multiple objective integer linear programming problem
• Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
• An interactive weighted Tchebycheff procedure for multiple objective programming
• Theory and algorithms for linear multiple objective programs with zero–one variables
• Linear multiple objective programs with zero–one variables
• Title not available (Why is that?)
• An Interactive Programming Method for Solving the Multiple Criteria Problem
• A combined approach to solve binary multicriteria problems
• Title not available (Why is that?)

Cited In (54)

• Title not available (Why is that?)
• A provably convergent heuristic for stochastic bicriteria integer programming
• Bi-objective project portfolio selection and staff assignment under uncertainty
• An improved algorithm for solving biobjective integer programs
• New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach
• Modeling target volume flows in forest harvest scheduling subject to maximum area restrictions
• FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
• An algorithm for solving bicriterial linear programming problems with parametrical coefficients in the objective functions
• Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems
• Title not available (Why is that?)
• Numerical analysis of algorithms for solving bicriteria discrete programming problems
• The \(L\)-shape search method for triobjective integer programming
• Algorithm robust for the bicriteria discrete optimization problem
• A meta-control algorithm for generating approximate solutions to binary integer programming problems
• Multi-criteria location planning for public facilities in tsunami-prone coastal areas
• Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
• Bicriteria network flow problems: Integer case
• Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
• A two-stage approach for bi-objective integer linear programming
• On the representation of the search region in multi-objective optimization
• BI-CRITERIA FOOD PACKING BY DYNAMIC PROGRAMMING(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests
• Nondominated Nash points: application of biobjective mixed integer programming
• Title not available (Why is that?)
• An algorithm for the bi-criterion integer programming problem
• A review of interactive methods for multiobjective integer and mixed-integer programming
• An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
• Efficient computation of the search region in multi-objective optimization
• A reduction algorithm for integer multiple objective linear programs
• PolySCIP
• A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming
• A survey of recent developments in multiobjective optimization
• A method for finding the set of non-dominated vectors for multiple objective integer linear programs
• ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design
• A branch and bound algorithm for mixed zero-one multiple objective linear programming
• A memetic algorithm for multi-objective dynamic location problems
• Balance in resource allocation problems: a changing reference approach
• An interactive procedure for multiple objective integer linear programming problems
• Algorithms for nonlinear integer bicriterion problems
• A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
• A class of practical interactive branch and bound algorithms for multicriteria integer programming
• An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing
• A multi-objective Monte Carlo tree search for forest harvest scheduling
• Integer programming duality in multiple objective programming
• Identification of a 2-Additive Bi-Capacity by Using Mathematical Programming
• An interactive algorithm for solving multiple objective integer linear programming problems
• A criterion space search algorithm for biobjective integer programming: the balanced box method
• A bi-objective approach to discrete cost-bottleneck location problems
• Multiobjective modelling and analysis of process planning in a manufacturing system
• Title not available (Why is that?)
• An exact algorithm for biobjective integer programming problems
• An exact criterion space search algorithm for a bi-objective blood collection problem
• A simple, efficient and versatile objective space algorithm for multiobjective integer programming
• On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem

This page was built for publication: An algorithm for the bi-criterion integer programming problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1075952)