A primal-like algorithm for zero-one integer Fractional Programming Problem

DOI10.1007/BF03004652MaRDI QIDQ4773508zbMATH OpenFDO

Authors Kanti Swarup, I. C. Sharma

Publication date 1973

Published in Trabajos de estadistica y de investigacion operativa (Search for Journal in Brave)

Mathematics Subject Classification ID

Nonlinear programming (90C30) Integer programming (90C10)

Cites work

• scientific article; zbMATH DE number 3167494 (Why is no real title available?)
• scientific article; zbMATH DE number 3373541 (Why is no real title available?)
• A New Foundation for a Simplified Primal Integer Programming Algorithm
• A Simplified Primal (All-Integer) Integer Programming Algorithm
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• An Automatic Method of Solving Discrete Programming Problems
• Extreme Point Mathematical Programming
• Letter to the Editor—Linear Fractional Functionals Programming
• On Nonlinear Fractional Programming
• Programming with linear fractional functionals
• SOME ASPECTS OF LINEAR FRACTIONAL FUNCTIONALS PROGRAMMING
• The Direct Power of Adjacent Vertex Programming Methods
• The Theory and Computation of Knapsack Functions

Cited in

(1)

• Bibliography in fractional programming

This page was built for publication: A primal-like algorithm for zero-one integer Fractional Programming Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4773508)