A branch and bound algorithm for mixed zero-one multiple objective linear programming

DOI10.1016/S0377-2217(97)00077-5zbMath0943.90063OpenAlexW2016131362MaRDI QIDQ1296117

Publication date: 10 September 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00077-5

zbMATH Keywords

integer programming branch and bound multiple criteria programming

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29)

Related Items

A fuzzy approach for bi-level integer non-linear programming problem ⋮ Bi-objective design-for-control of water distribution networks with global bounds ⋮ An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems ⋮ An improved algorithm for solving biobjective integer programs ⋮ Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example ⋮ A discussion of scalarization techniques for multiple objective integer programming ⋮ Heuristic approaches for biobjective mixed 0-1 integer linear programming problems ⋮ Solution approaches for equitable multiobjective integer programming problems ⋮ A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods ⋮ Efficient automated schematic map drawing using multiobjective mixed integer programming ⋮ Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case ⋮ Multi-directional local search ⋮ An exact algorithm for biobjective mixed integer linear programming problems ⋮ A hybrid approach for biobjective optimization ⋮ A review of interactive methods for multiobjective integer and mixed-integer programming ⋮ A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs ⋮ Bound sets for biobjective combinatorial optimization problems ⋮ Network Models for Multiobjective Discrete Optimization ⋮ 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 branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems ⋮ Exact method based on solution space cut for bi-objective Seru production ⋮ An exact criterion space search method for a bi-objective nursing home location and allocation problem ⋮ Twenty years of continuous multiobjective optimization in the twenty-first century ⋮ An exact criterion space search algorithm for a bi-objective blood collection problem ⋮ A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives ⋮ Solving Multiobjective Mixed Integer Convex Optimization Problems ⋮ Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets ⋮ Branch-and-Bound for Bi-objective Integer Programming ⋮ 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 ⋮ Two phase algorithms for the bi-objective assignment problem ⋮ An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics ⋮ Multiobjective 0-1 integer programming for the use of sugarcane residual biomass in energy cogeneration ⋮ 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 ⋮ 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 ⋮ Branch and bound method for multiobjective pairing selection ⋮ 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 ⋮ Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization ⋮ A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem ⋮ A Method for Generating a Well-Distributed Pareto Set in Multiple Objective Mixed Integer Linear Programs Based on the Decision Maker’s Initial Aspiration Level ⋮ Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms ⋮ Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core ⋮ Bi-objective optimisation over a set of convex sub-problems ⋮ Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming ⋮ A multiple criteria decision-aid approach in defining national priorities for greenhouse gases emissions reduction in the energy sector

Uses Software

GAMS

Cites Work