An improved algorithm for solving biobjective integer programs
From MaRDI portal
Publication:2379864
DOI10.1007/s10479-006-0058-zzbMath1190.90196OpenAlexW2009575019MaRDI QIDQ2379864
Matthew J. Saltzman, Margaret M. Wiecek, Ted K. Ralphs
Publication date: 23 March 2010
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-006-0058-z
Related Items
An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs ⋮ A bi-objective approach to discrete cost-bottleneck location problems ⋮ An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems ⋮ Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case ⋮ An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems ⋮ Nondominated Nash points: application of biobjective mixed integer programming ⋮ An efficient procedure for finding best compromise solutions to the multi-objective assignment problem ⋮ Optimal duty rostering for toll enforcement inspectors ⋮ A weighted multiobjective optimization method for mixed-model assembly line problem ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ Network Models for Multiobjective Discrete Optimization ⋮ 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 ⋮ Optimal hierarchical clustering on a graph ⋮ Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests ⋮ Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems ⋮ Some algebraic methods for solving multiobjective polynomial integer programs ⋮ Stochastic multiobjective optimization: Sample average approximation and applications ⋮ Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming ⋮ Asymptotically optimal staffing of service systems with joint QoS constraints ⋮ Biobjective Simulation Optimization on Integer Lattices Using the Epsilon-Constraint Method in a Retrospective Approximation Framework ⋮ An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits ⋮ 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 multiple criteria ranking method based on game cross-evaluation approach ⋮ Multi-objective decision analysis for competence-oriented project portfolio selection ⋮ An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems ⋮ An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets ⋮ 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 ⋮ Decomposition, reformulation, and diving in university course timetabling ⋮ A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems ⋮ The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm for the bi-criterion integer programming problem
- Algorithms for nonlinear integer bicriterion problems
- A reference direction approach to multiple objective integer linear programming
- Multicriteria dynamic programming with an application to the integer case
- An algorithm for the multiple objective integer linear programming problem
- Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem
- Bicriteria network flow problems: Integer case
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- An interactive procedure for multiple objective integer linear programming problems
- An interactive algorithm for solving multiple objective integer linear programming problems
- Efficient solutions and bounds on tradeoffs
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
- Three algorithms for bicriteria integer linear programs
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
- Unbiased approximation in multicriteria optimization
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Dynamic parametric bounds on efficient outcomes in interactive multiple criteria decision making problems
- Using trade-off information in decision-making algorithms
- Proper efficiency and the theory of vector maximization
- Approximation methods in multiobjective programming
- An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
- An interactive method for bicriteria integer programming
- Theory and algorithms for linear multiple objective programs with zero–one variables
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
- Linear multiple objective programs with zero–one variables
- Preference Structure Representation Using Convex Cones in Multicriteria Integer Programming
- An interactive weighted Tchebycheff procedure for multiple objective programming
- An algorithm for the biobjective integer minimum cost flow problem
- Norm-based approximation in bicriteria programming
- The cable trench problem: Combining the shortest path and minimum spanning tree problems