An improved algorithm for solving biobjective integer programs
From MaRDI portal
Recommendations
- An exact algorithm for biobjective integer programming problems
- An algorithm for the bi-criterion integer programming problem
- Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
- An exact algorithm for biobjective mixed integer linear programming problems
- Dynamic programming algorithms for the bi-objective integer knapsack problem
Cites work
- scientific article; zbMATH DE number 3427111 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 175969 (Why is no real title available?)
- scientific article; zbMATH DE number 3568375 (Why is no real title available?)
- scientific article; zbMATH DE number 553773 (Why is no real title available?)
- scientific article; zbMATH DE number 1149798 (Why is no real title available?)
- scientific article; zbMATH DE number 2160609 (Why is no real title available?)
- scientific article; zbMATH DE number 2209474 (Why is no real title available?)
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- A reference direction approach to multiple objective integer linear programming
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Algorithms for nonlinear integer bicriterion problems
- An algorithm for the bi-criterion integer programming problem
- An algorithm for the biobjective integer minimum cost flow problem
- An algorithm for the multiple objective integer linear programming problem
- An interactive algorithm for solving multiple objective integer linear programming problems
- An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
- An interactive method for bicriteria integer programming
- An interactive procedure for multiple objective integer linear programming problems
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Approximation methods in multiobjective programming
- Bicriteria network flow problems: Integer case
- Dynamic parametric bounds on efficient outcomes in interactive multiple criteria decision making problems
- Efficient solutions and bounds on tradeoffs
- Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem
- Linear multiple objective programs with zero–one variables
- Multicriteria dynamic programming with an application to the integer case
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
- Norm-based approximation in bicriteria programming
- Preference Structure Representation Using Convex Cones in Multicriteria Integer Programming
- Proper efficiency and the theory of vector maximization
- The cable trench problem: Combining the shortest path and minimum spanning tree problems
- Theory and algorithms for linear multiple objective programs with zero–one variables
- Three algorithms for bicriteria integer linear programs
- Unbiased approximation in multicriteria optimization
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
- Using trade-off information in decision-making algorithms
Cited in
(44)- A provably convergent heuristic for stochastic bicriteria integer programming
- Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming
- Multi-objective integer programming: an improved recursive algorithm
- An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems
- A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
- The search-and-remove algorithm for biobjective mixed-integer linear programming problems
- An exact -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- scientific article; zbMATH DE number 6303703 (Why is no real title available?)
- Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems
- Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- An algorithm for the biobjective integer minimum cost flow problem
- Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
- The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program
- A two-stage approach for bi-objective integer linear programming
- Nondominated Nash points: application of biobjective mixed integer programming
- Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests
- An algorithm for the bi-criterion integer programming problem
- The weighted \(p\)-norm weight set decomposition for multiobjective discrete optimization problems
- 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
- An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs
- Optimal hierarchical clustering on a graph
- 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
- Stochastic multiobjective optimization: Sample average approximation and applications
- Network Models for Multiobjective Discrete Optimization
- Asymptotically optimal staffing of service systems with joint QoS constraints
- Some algebraic methods for solving multiobjective polynomial integer programs
- An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets
- An efficient procedure for finding best compromise solutions to the multi-objective assignment problem
- Multi-objective decision analysis for competence-oriented project portfolio selection
- Decomposition, reformulation, and diving in university course timetabling
- Balance in resource allocation problems: a changing reference approach
- Optimal duty rostering for toll enforcement inspectors
- A weighted multiobjective optimization method for mixed-model assembly line problem
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- Biobjective Simulation Optimization on Integer Lattices Using the Epsilon-Constraint Method in a Retrospective Approximation Framework
- A bi-objective approach to discrete cost-bottleneck location problems
- A criterion space search algorithm for biobjective integer programming: the balanced box method
- A multiple criteria ranking method based on game cross-evaluation approach
- An exact algorithm for biobjective integer programming problems
This page was built for publication: An improved algorithm for solving biobjective integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379864)
