A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs
From MaRDI portal
Publication:5087716
Recommendations
- A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs
- A criterion space algorithm for solving linear multiplicative programming problems
- A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
- A branch-and-cut algorithm for mixed-integer bilinear programming
Cites work
- scientific article; zbMATH DE number 5485471 (Why is no real title available?)
- A Bargaining Framework in Supply Chains: The Assembly Problem
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method
- A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs
- A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
- A coordinating contract for transshipment in a two-company supply chain
- A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method
- A general branch-and-bound framework for continuous global multiobjective optimization
- A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program
- An algorithm for optimizing a linear function over an integer efficient set
- An exact algorithm for biobjective mixed integer linear programming problems
- An objective space cut and bound algorithm for convex multiplicative programmes
- Benchmarking optimization software with performance profiles.
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computing the nadir point for multiobjective discrete optimization problems
- Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization
- Finding all nondominated points of multi-objective integer programs
- Game-theoretic analysis of cooperation among supply chain agents: Review and extensions
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs
- On finding representative non-dominated points for bi-objective integer network flow problems
- Optimization over the efficient set
- Optimizing Over the Efficient Set Using a Top-Down Search of Faces
- Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes
- Rational convex programs and efficient algorithms for 2-player Nash and nonsymmetric bargaining games
- SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems
- The bargaining problem
- The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
This page was built for publication: A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087716)
