Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
From MaRDI portal
Publication:814696
DOI10.1016/j.amc.2005.01.038zbMath1084.65063OpenAlexW2035828992MaRDI QIDQ814696
Publication date: 7 February 2006
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2005.01.038
linear programmingnumerical examplesMixed integer programmingMultiple objective programmingBranch and bound method
Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Linear programming (90C05)
Related Items (39)
Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems ⋮ SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems ⋮ Dynamic programming algorithms for the bi-objective integer knapsack problem ⋮ Bi-objective design-for-control of water distribution networks with global bounds ⋮ An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems ⋮ Heuristic approaches for biobjective mixed 0-1 integer linear programming problems ⋮ A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods ⋮ Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case ⋮ An exact algorithm for biobjective mixed integer linear programming problems ⋮ A hybrid approach for biobjective optimization ⋮ Network Models for Multiobjective Discrete Optimization ⋮ Finding all nondominated points of multi-objective integer programs ⋮ Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs ⋮ Branch-and-bound and objective branching with three or more objectives ⋮ A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising ⋮ An exact criterion space search method for a bi-objective nursing home location and allocation problem ⋮ Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming ⋮ Solving Multiobjective Mixed Integer Convex Optimization Problems ⋮ Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets ⋮ A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method ⋮ Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint ⋮ An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics ⋮ Fathoming rules for biobjective mixed integer linear programs: review and extensions ⋮ Multi-objective branch and bound ⋮ A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs ⋮ A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems ⋮ The search-and-remove algorithm for biobjective mixed-integer linear programming problems ⋮ Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems ⋮ An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems ⋮ An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems ⋮ Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations ⋮ Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming ⋮ A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method ⋮ Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems ⋮ Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms ⋮ GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs ⋮ Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core ⋮ Bi-objective optimisation over a set of convex sub-problems ⋮ A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interactive multiple objective optimization: Survey. I: Continuous case
- Zero-one programming with multiple criteria
- Linear multiobjective programming
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- Interactive analysis of multiple-criteria project scheduling problems
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- A survey and annotated bibliography of multiobjective combinatorial optimization
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- A Bibliography on the Applications of Mathematical Programming Multiple-objective Methods
- Multi‐objective combinatorial optimization problems: A survey
- A Bibliographic Survey of the Activities and International Nature of Multiple Criteria Decision Making
This page was built for publication: Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
