Extended formulations in combinatorial optimization

This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By “perfect formulation”, we mean a system of linear inequalities that describes the convex hull of feasible solutions, viewed as vectors. Natural perfect formulations often have a number of inequ...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Annals of operations research Ročník 204; číslo 1; s. 97 - 143
Hlavní autoři:	Conforti, Michele, Cornuéjols, Gérard, Zambelli, Giacomo
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Boston Springer US 01.04.2013 Springer Springer Nature B.V
Témata:	Business and Management Combinatorial analysis Combinatorial optimization Combinatorics Discretization Dynamic programming Formulations Inequalities Inequalities (Mathematics) Integer programming Knapsack problem Operations research Operations Research/Decision Theory Optimization Polyhedrons Studies Theorems Theory of Computation Variables United States Italy Combinatorial optimization polyhedral combinatorics Extended formulations
ISSN:	0254-5330, 1572-9338
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!