Work

Polyhedral combinatorics and combinatorial optimization

Year: 2004
Type: article
Abstract: 1 Introduction Combinatorial optimization searches for an optimum object in a finite collectionof objects. Typically, the collection has a concise representation (like a graph), while the number of objects is huge-- more precisely, grows exponentially inthe size of the representation (like all matchings or all Hamiltonian circuits). So scanning all objects one by one and selecting the best one is not an option.More efficient methods should be found.
Language: English
Open Access status: green
OpenAlex ID: W2118066573
FWCI:
Cites: 28
Cited by: 3
Related to: 10