On Solving Fractional (0, 1) Programs By Implicit Enumeration

DOI10.1080/03155986.1976.11731643zbMath0344.90025OpenAlexW2398154102MaRDI QIDQ4113594

Daniel Granot, Frieda Granot

Publication date: 1976

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1976.11731643

Mathematics Subject Classification ID

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

Related Items (7)

A global approach for general \(0-1\) fractional programming ⋮ Fractional 0-1 programming and submodularity ⋮ Fractional 0-1 programming: applications and algorithms ⋮ A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems ⋮ Mixed integer programming for the 0--1 maximum probability model. ⋮ A parametric approach to integer linear fractional programming: Newton's and hybrid-Newton methods for an optimal road maintenance problem ⋮ Bibliography in fractional programming

This page was built for publication: On Solving Fractional (0, 1) Programs By Implicit Enumeration