Linear programming by Vašek Chvátal(
Book
)23
editions published
between
1983
and
2003
in
English and Undetermined
and held by
823 WorldCat member
libraries
worldwide
"This comprehensive treatment of the fundamental ideas and principles of linear programming covers basic theory, selected
applications, network flow problems, and advanced techniques. Using specific examples to illuminate practical and theoretical
aspects of the subject, the author clearly reveals the structures of fully detailed proofs. The presentation is geared toward
modern efficient implementations of the simplex method and appropriate data structures for network flow problems. Completely
self-contained, it develops even elementary facts on linear equations and matrices from the beginning." -- Back cover

Topics on perfect graphs by V Chvátal(
Book
)7
editions published
in
1984
in
English
and held by
226 WorldCat member
libraries
worldwide
The purpose of this book is to present selected results on perfect graphs in a single volume. These take the form of reprinted
classical papers, survey papers or new results

Combinatorial optimization : methods and applications by Vašek Chvátal(
Book
)10
editions published
in
2011
in
English
and held by
32 WorldCat member
libraries
worldwide
This book is a collection of six articles arising from the meeting of the NATO Advanced Study Institute (ASI) "Combinatorial
Optimization: Methods and Applications", which was held at the University of Montreal in June 2006. This ASI consisted of
seven series of five one-hour lectures and one series of four one-hour lectures. It was attended by some sixty students of
graduate or postdoctoral level from fifteen countries worldwide. Topics include: integer and mixed integer programming, facility
location, branching on split disjunctions, convexity in combinatorial optimization, and VLSI design. Although drawn from the
2006 lecture series, the articles included in this volume were all either written or updated by the authors in 2010, so that
this collection of papers reflects a state-of-the-art overview of combinatorial optimization methods and their applications

Recognizing dart-free perfect graphs by Vašek Chvátal(
Book
)10
editions published
between
1989
and
1992
in
3
languages
and held by
18 WorldCat member
libraries
worldwide
Abstract: "The 'dart' is the graph with vertices a, b, c, d, e and edges ab, ac, ad, ae, bd, cd. We present a polynomial-time
algorithm to recognize dart-free perfect graphs. The algorithm is based on a decomposition theorem elucidating the structure
of these graphs."

The traveling salesman problem : a computational study by David L Applegate(
)9
editions published
between
2006
and
2011
in
English and Undetermined
and held by
17 WorldCat member
libraries
worldwide
Presents the findings on one of the most intensely investigated subjects in computational mathematics - the travelling salesman
problem. This book describes the method and computer code used to solve a range of large-scale problems, and demonstrates
the interplay of applied mathematics with increasingly powerful computing platforms

Small transversals in hypergraphs by Vašek Chvátal(
Book
)9
editions published
between
1988
and
1990
in
English and German
and held by
14 WorldCat member
libraries
worldwide

Cutting planes in combinatorics by Vašek Chvátal(
Book
)4
editions published
in
1984
in
German and English
and held by
7 WorldCat member
libraries
worldwide

Lecture notes on the new AKS sorting network by Vašek Chvátal(
Book
)3
editions published
in
1992
in
English
and held by
6 WorldCat member
libraries
worldwide
The basic units in this new construction are sorting networks on M wires such that M is relatively small; these may be thought
of as indivisible hardware elements (rather than networks made from comparators); following Knuth, we call them M-sorters.
For every choice of positive integers M and N such that N [> or =] M, the construction yields a sorting network on N wires,
made from M-sorters, whose depth is at most (48 + o(1)) log [subscript M] N + 115 as M [approaches] [infinity]. (It is worth
emphasizing that the asymptotic o(1) here is relative to M rather than N.)."

Packing paths perfectly by J Akiyama(
Book
)4
editions published
in
1988
in
English
and held by
6 WorldCat member
libraries
worldwide

Determining the Stability Number of a Graph by Vašek Chvátal(
Book
)5
editions published
between
1976
and
1977
in
English
and held by
5 WorldCat member
libraries
worldwide
Certain rules for deriving upper bounds on the stability number of a graph are formalized. The resulting system is powerful
enough to (1) encompass the algorithms of Tarjan's type and (2) provide very short proofs on graphs for which the stability
number equals the clique-covering number. However, the main result shows that for almost all graphs with a (sufficiently large)
linear number of edges, proofs within the system must have at least exponential length

Degrees and matchings by Vašek Chvátal(
Book
)4
editions published
in
1972
in
English
and held by
5 WorldCat member
libraries
worldwide
Let n, b, d be positive integers. D. Hanson proposed to evaluate f(n, b, d), the largest possible number of edges in a graph
with n vertices having no vertex of degree greater than d and no set of more than b independent edges. Using the alternating
path method, he found partial results in this direction. he author completes Hanson's work; the proof technique has a linear
programming flavor and uses Berge's matching formula. (Author)