scientific article; zbMATH DE number 863497
From MaRDI portal
Publication:4871776
zbMath0854.90117MaRDI QIDQ4871776
László Lovász, Martin Grötschel
Publication date: 8 April 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
dynamic programmingmatrix methodsbranch-and-boundgreedy algorithmenumerationlocal improvementaugmenting pathsuncrossing
Linear programming (90C05) Combinatorial optimization (90C27) Dynamic programming (90C39) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Related Items
Greedily finding a dense subgraph, On dependent randomized rounding algorithms, Integer Programming: Optimization and Evaluation Are Equivalent, On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming, Production-process optimization algorithm: application to fed-batch bioprocess, On the connection of hypergraph theory with formal concept analysis and rough set theory, Non-standard approaches to integer programming, Putting continuous metaheuristics to work in binary search spaces, Test sets of integer programs
