Fractional Combinatorial Optimization

Tomasz Radzik ()
Additional contact information
Tomasz Radzik: King’s College London, Department of Computer Science

A chapter in Handbook of Combinatorial Optimization, 1998, pp 429-478 from Springer

Abstract: Abstract An instance of a fractional combinatorial optimization problem F consists of a specification of a set $$\chi\subseteq{\left\{{0,1}\right\}^p}$$ , and two functions f : χ → R and g : χ → R. The task is to $$F:maximize\frac{{f(x)}}{{g(x)}},forx \in X$$

Keywords: Span Tree; Newton Method; Binary Search; Fractional Programming; Maximum Cost (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0303-9_6

Ordering information: This item can be ordered from
http://www.springer.com/9781461303039

DOI: 10.1007/978-1-4613-0303-9_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().