Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs

An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program ⋮ A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs ⋮ Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization ⋮ An exact criterion space search algorithm for a bi-objective blood collection problem

Unnamed Item
On finding representative non-dominated points for bi-objective integer network flow problems
An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
An exact algorithm for biobjective mixed integer linear programming problems
Finding all nondominated points of multi-objective integer programs
An outer approximation method for minimizing the product of several convex functions on a convex set
Bound sets for biobjective combinatorial optimization problems
A convex analysis approach for convex multiplicative programming
A new global optimization approach for convex multiplicative programming
Multi-objective integer programming: a general approach for generating all non-dominated solutions
On-line and off-line vertex enumeration by adjacency lists
A global optimization approach for solving the convex multiplicative programming problem
Linear multiplicative programming
Multiplicative programming problems: Analysis and efficient point search heuristic
An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
Outcome-space cutting-plane algorithm for linear multiplicative programming
A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints
Efficient computation of the search region in multi-objective optimization
Multi-objective branch and bound
The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
A new method for optimizing a linear function over the efficient set of a multiobjective integer program
An objective space cut and bound algorithm for convex multiplicative programmes
A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
Computing the nadir point for multiobjective discrete optimization problems
An algorithm for optimizing a linear function over an integer efficient set
Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes
A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method
A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method
An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
Bicriteria Transportation Problem
Optimizing Over the Efficient Set Using a Top-Down Search of Faces
A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs
Multicriteria Optimization
Optimization over the efficient set
A finite branch-and-bound algorithm for linear multiplicative programming
Benchmarking optimization software with performance profiles.