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

DOI10.1007/BF03004652zbMATH Open0286.90045MaRDI QIDQ4773508FDOQ4773508

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

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

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)