作者: Karla Hoffman , Manfred Padberg
DOI: 10.1007/978-3-642-82450-0_3
关键词:
摘要: A tutorial outline of the polyhedral theory that underlies linear programming (LP)-based combinatorial problem solving is given. Design aspects a solver are discussed in general terms. Three computational studies using developed past fifteen years surveyed: one addresses symmetric traveling salesman problem, another optimal triangulation input/output matrices, and third optimization large-scale zero-one problems.