An Algorithm for solving the Integer Linear Fractional Programs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3495856 (Why is no real title available?)
- An Algorithm for Finding All Vertices of Convex Polyhedral Sets
- Integer Programming Post-Optimal Analysis with Cutting Planes
- On the Polyhedrality of the Convex Hull of the Feasible Set of an Integer Program
- Parametric Solution of Bicriterion Linear Fractional Programs
- Programming with linear fractional functionals
Cited in
(11)- On integer fractional linear programming
- scientific article; zbMATH DE number 4080779 (Why is no real title available?)
- Solution of some convex separable resource allocation and production planning problems with bounds on the variables
- scientific article; zbMATH DE number 3976806 (Why is no real title available?)
- scientific article; zbMATH DE number 66871 (Why is no real title available?)
- An algorithm for solving an integer linear fractional/quadratic bilevel programming problem
- Constrained integer linear fractional programming problem
- scientific article; zbMATH DE number 4027204 (Why is no real title available?)
- An algorithm for the integer linear fractional bilevel programming problem
- scientific article; zbMATH DE number 3945902 (Why is no real title available?)
- scientific article; zbMATH DE number 3856850 (Why is no real title available?)
This page was built for publication: An Algorithm for solving the Integer Linear Fractional Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4272560)