Constrained integer fractional programming problem with box constraints
From MaRDI portal
Publication:1689256
Recommendations
Cites work
- A breakpoint search approach for convex resource allocation problems with bounded variables
- A new algorithm for linear multiobjective programming problems with bounded variables
- A strongly polynomial method for solving integer max-linear optimization problems in a generic case
- An Algorithm for the Bounded Variable Integer Programming Problem
- An iterative approach to solve multiobjective linear fractional programming problems
- Computational Experience with an Interior Point Cutting Plane Algorithm
- Constrained integer linear fractional programming problem
- Cutting planes for integer programs with general integer variables
- Cutting planes in integer and mixed integer programming
- Cutting-plane method based on epigraph approximation with discarding the cutting planes
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
- Fractional programming formulation for the vertex coloring problem
- scientific article; zbMATH DE number 3829627 (Why is no real title available?)
- scientific article; zbMATH DE number 3501240 (Why is no real title available?)
- scientific article; zbMATH DE number 3557508 (Why is no real title available?)
- scientific article; zbMATH DE number 1342815 (Why is no real title available?)
- scientific article; zbMATH DE number 2092205 (Why is no real title available?)
- scientific article; zbMATH DE number 757682 (Why is no real title available?)
- Image space analysis of generalized fractional programs
- Integer Programming with Bounded Variables via Canonical Separation
- Minimization of the sum of three linear fractional functions
- Nonlinear chance constrained problems: optimality conditions, regularization and solvers
- One approach to constructing cutting algorithms with dropping of cutting planes
- Polynomial Interior Point Cutting Plane Methods
- Ranking in integer linear fractional programming problems
- Ranking in integer programming with bounded variables.
- Sequence independent lifting in mixed integer programming
- SOME ASPECTS OF LINEAR FRACTIONAL FUNCTIONALS PROGRAMMING
- The free parametrization for linear programming with bounded variables
Cited in
(4)
This page was built for publication: Constrained integer fractional programming problem with box constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689256)