Solution of a fractional combinatorial optimization problem by mixed integer programming
From MaRDI portal
Publication:3411295
Recommendations
Cites work
- scientific article; zbMATH DE number 1302174 (Why is no real title available?)
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- scientific article; zbMATH DE number 757682 (Why is no real title available?)
- scientific article; zbMATH DE number 3197631 (Why is no real title available?)
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A global approach for general 0-1 fractional programming
- A note on a global approach for general 0-1 fractional programming
- Boolean query optimization and the 0-1 hyperbolic sum problem
- Fractional programming
- Hyperbolic 0-1 programming and query optimization in information retrieval
- Problèmes fractionnaires : tour d'horizon sur les applications et méthodes de résolution
- Solving a (0, 1) hyperbolic program by branch and bound
- Solving the sum-of-ratios problem by an interior-point method
- The set covering problem with linear fractional functional
Cited in
(8)- scientific article; zbMATH DE number 4080779 (Why is no real title available?)
- Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations
- A tractable discrete fractional programming: application to constrained assortment optimization
- Column generation approaches for the software clustering problem
- Mixed-integer linear programming formulations for the software clustering problem
- scientific article; zbMATH DE number 4143800 (Why is no real title available?)
- Formulating the mixed integer fractional posynomial programming
- The attractive traveling salesman problem
This page was built for publication: Solution of a fractional combinatorial optimization problem by mixed integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3411295)