A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method
From MaRDI portal
Publication:2802251
DOI10.1287/ijoc.2015.0657zbMath1338.90365OpenAlexW2194405083MaRDI QIDQ2802251
Natashia Boland, Hadi Charkhgard, Savelsbergh, Martin W. P.
Publication date: 25 April 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2015.0657
Related Items
SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems ⋮ The \(L\)-shape search method for triobjective integer programming ⋮ The bi-objective mixed capacitated general routing problem with different route balance criteria ⋮ Nondominated Nash points: application of biobjective mixed integer programming ⋮ A hybrid approach for biobjective optimization ⋮ The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ Balance in resource allocation problems: a changing reference approach ⋮ An exact algorithm for biobjective integer programming problems ⋮ Computing representations using hypervolume scalarizations ⋮ An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems ⋮ A two-stage approach for bi-objective integer linear programming ⋮ Optimal hierarchical clustering on a graph ⋮ Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests ⋮ 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 ⋮ Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix ⋮ An exact criterion space search algorithm for a bi-objective blood collection problem ⋮ Solving Multiobjective Mixed Integer Convex Optimization Problems ⋮ A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming ⋮ Branch-and-Bound for Bi-objective Integer Programming ⋮ A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs ⋮ A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method ⋮ Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems ⋮ Fathoming rules for biobjective mixed integer linear programs: review and extensions ⋮ The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs ⋮ A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs ⋮ Bi-objective autonomous vehicle repositioning problem with travel time uncertainty ⋮ Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs ⋮ 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 ⋮ Multiobjective Integer Programming: Synergistic Parallel Approaches ⋮ FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming ⋮ A NEW APPROACH TO SELECT THE BEST SUBSET OF PREDICTORS IN LINEAR REGRESSION MODELLING: BI-OBJECTIVE MIXED INTEGER LINEAR PROGRAMMING ⋮ Decomposition of loosely coupled integer programs: a multiobjective perspective ⋮ Bi-objective multistage stochastic linear programming ⋮ Bi-objective facility location under uncertainty with an application in last-mile disaster relief
Cites Work
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
- Finding all nondominated points of multi-objective integer programs
- Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- An algorithm for the bi-criterion integer programming problem
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- Multi-objective integer programming: an improved recursive algorithm
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- An improved algorithm for solving biobjective integer programs
- A discussion of scalarization techniques for multiple objective integer programming
- Two phase algorithms for the bi-objective assignment problem
- Finding representative systems for discrete bicriterion optimization problems
- Performance of the MOSA method for the bicriteria assignment problem
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem
- The multiobjective multidimensional knapsack problem: a survey and a new approach
- A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
- Bicriteria Transportation Problem
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- An interactive weighted Tchebycheff procedure for multiple objective programming
- A revised simplex method for linear multiple objective programs
- The Triangle Splitting Method for Biobjective Mixed Integer Programming
- Benchmarking optimization software with performance profiles.
