scientific article; zbMATH DE number 3609444
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Trees (05C05) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Linear programming (90C05) Boolean programming (90C09) Integer programming (90C10) Applications of graph theory to circuits and networks (94C15)
- A cutting plane procedure for the travelling salesman problem on road networks
- On cutting-plane proofs in combinatorial optimization
- Characterizations of adjacency on the branching polyhedron
- On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets
- Adjacent vertices on the b-matching polyhedron
- The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
- Euclidean semi-matchings of random samples
- Clique tree inequalities define facets of the asymmetric traveling salesman polytope
- A cutting plane algorithm for minimum perfect 2-matchings
- Complete linear descriptions of small asymmetric traveling salesman polytopes
- Solving the max-cut problem using eigenvalues
- Matroid optimization problems with monotone monomials in the objective
- The facets of the spanning trees polytope
- Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds
- The perfectly matchable subgraph polytope of a bipartite graph
- On the symmetric travelling salesman problem I: Inequalities
- On the symmetric travelling salesman problem II: Lifting theorems and facets
- The facets of the asymmetric 5-city traveling salesman polytope
- The prize collecting traveling salesman problem
- Optimum matching forests III: Facets of matching forest polyhedra
- Lineare Charakterisierungen von Travelling Salesman Problemen
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- Halin graphs and the travelling salesman problem
- Distance conserving reductions for nonoriented networks
- Facets of the (s,t)-p-path polytope
- Minimum cut bases in undirected networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4174517)
