Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)

Cites work

\(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
A characterization of perfect graphs
A combinatorial theorem in plane geometry
A Greedy Heuristic for the Set-Covering Problem
A method in graph theory
A structure theorem for the consecutive 1's property
Bull-free Berge graphs are perfect
Claude Berge: June 5, 1926 -- June, 30, 2002
Determining the Stability Number of a Graph
Edmonds polytopes and a hierarchy of combinatorial problems
Edmonds polytopes and weakly hamiltonian graphs
Flip-Flops in Hypohamiltonian Graphs
Generalized Ramsey Theory for Graphs. II. Small Diagonal Numbers
Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
Geometry of cuts and metrics
Hard Knapsack Problems
scientific article; zbMATH DE number 3869356 (Why is no real title available?)
scientific article; zbMATH DE number 3465337 (Why is no real title available?)
scientific article; zbMATH DE number 3571502 (Why is no real title available?)
scientific article; zbMATH DE number 3626518 (Why is no real title available?)
scientific article; zbMATH DE number 1256700 (Why is no real title available?)
scientific article; zbMATH DE number 1982172 (Why is no real title available?)
scientific article; zbMATH DE number 3214408 (Why is no real title available?)
Hypergraphs and Ramseyian Theorems
In praise of Claude Berge
Many hard examples for resolution
Maximally violated mod-p cuts for the capacitated vehicle-routing problem
Maximum matching and a polyhedron with 0,1-vertices
Monochromatic paths in edge-colored graphs
Normal hypergraphs and the perfect graph conjecture
Not every 2-tough graph is Hamiltonian
On certain polytopes associated with graphs
On cutting-plane proofs in combinatorial optimization
On graphs with Hamiltonian squares
On Hamilton's ideals
On the separation of maximally violated mod-\(k\) cuts
On the symmetric travelling salesman problem I: Inequalities
On the symmetric travelling salesman problem: Solution of a 120-city problem
Outline of an algorithm for integer solutions to linear programs
Separating a superclass of comb inequalities in planar graphs
Separating maximally violated comb inequalities in planar graphs
Skew partitions in perfect graphs
Solution of large-scale symmetric travelling salesman problems
Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
Some properties of minimal imperfect graphs
Star-cutsets and perfect graphs
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
The discipline number of a graph
The ellipsoid method and its consequences in combinatorial optimization
The smallest triangle-free 4-chromatic 4-regular graph
The story of perfectly orderable graphs
The traveling salesman problem. A computational study.
Tough graphs and Hamiltonian circuits.
TSPLIB—A Traveling Salesman Problem Library
Weakly triangulated graphs

Describes a project that uses

Uses Software

TSPLIB
Concorde

This page was built for publication: Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373937)