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 programsA bi-objective approach to discrete cost-bottleneck location problemsAn exact scalarization method with multiple reference points for bi-objective integer linear optimization problemsMultiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective caseAn augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problemsNondominated Nash points: application of biobjective mixed integer programmingAn efficient procedure for finding best compromise solutions to the multi-objective assignment problemOptimal duty rostering for toll enforcement inspectorsA weighted multiobjective optimization method for mixed-model assembly line problemBranch-and-Bound for Biobjective Mixed-Integer Linear ProgrammingNetwork Models for Multiobjective Discrete OptimizationBalance in resource allocation problems: a changing reference approachAn exact algorithm for biobjective integer programming problemsA two-stage approach for bi-objective integer linear programmingOptimal hierarchical clustering on a graphBi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical testsAnalysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problemsSome algebraic methods for solving multiobjective polynomial integer programsStochastic multiobjective optimization: Sample average approximation and applicationsEfficient Storage of Pareto Points in Biobjective Mixed Integer ProgrammingAsymptotically optimal staffing of service systems with joint QoS constraintsBiobjective Simulation Optimization on Integer Lattices Using the Epsilon-Constraint Method in a Retrospective Approximation FrameworkAn exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profitsVariants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problemsEfficient computation of the search region in multi-objective optimizationA multiple criteria ranking method based on game cross-evaluation approachMulti-objective decision analysis for competence-oriented project portfolio selectionAn improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problemsAn exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test setsBranching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programmingA Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box MethodDecomposition, reformulation, and diving in university course timetablingA linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problemsThe augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program


Uses Software


Cites Work