Pages that link to "Item:Q2379864"
From MaRDI portal
The following pages link to An improved algorithm for solving biobjective integer programs (Q2379864):
Displaying 34 items.
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case (Q339612) (← links)
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems (Q339623) (← links)
- An efficient procedure for finding best compromise solutions to the multi-objective assignment problem (Q342019) (← links)
- A weighted multiobjective optimization method for mixed-model assembly line problem (Q364423) (← links)
- Asymptotically optimal staffing of service systems with joint QoS constraints (Q475145) (← links)
- Some algebraic methods for solving multiobjective polynomial integer programs (Q633078) (← links)
- Stochastic multiobjective optimization: Sample average approximation and applications (Q650222) (← links)
- An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems (Q828841) (← links)
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits (Q953423) (← links)
- Multi-objective decision analysis for competence-oriented project portfolio selection (Q976375) (← links)
- Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
- A bi-objective approach to discrete cost-bottleneck location problems (Q1615950) (← links)
- Nondominated Nash points: application of biobjective mixed integer programming (Q1653352) (← links)
- Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems (Q1750397) (← links)
- Efficient computation of the search region in multi-objective optimization (Q1753505) (← links)
- A multiple criteria ranking method based on game cross-evaluation approach (Q1761932) (← links)
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems (Q2016277) (← links)
- Balance in resource allocation problems: a changing reference approach (Q2178919) (← links)
- An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets (Q2282534) (← links)
- Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming (Q2286918) (← links)
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems (Q2342947) (← links)
- Optimal duty rostering for toll enforcement inspectors (Q2398431) (← links)
- A two-stage approach for bi-objective integer linear programming (Q2417052) (← links)
- An exact algorithm for biobjective integer programming problems (Q2668742) (← links)
- A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method (Q2802251) (← links)
- The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program (Q2865174) (← links)
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming (Q5085998) (← links)
- Network Models for Multiobjective Discrete Optimization (Q5086002) (← links)
- Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming (Q5131728) (← links)
- Biobjective Simulation Optimization on Integer Lattices Using the Epsilon-Constraint Method in a Retrospective Approximation Framework (Q5148193) (← links)
- An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs (Q5879665) (← links)
- Optimal hierarchical clustering on a graph (Q6065857) (← links)
- Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests (Q6080592) (← links)
- Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems (Q6162512) (← links)