On the public citation graph
Edmonds polytopes and weakly hamiltonian graphs
0 signed · 150 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_1openalex-snapshot
Solution of a Large-Scale Traveling-Salesman Problem
inferredcites →https://doi.org/10.1016/0012-365x(73)90138-6openalex-snapshot
Tough graphs and hamiltonian circuits
inferredcites →https://doi.org/10.1016/0012-365x(73)90167-2openalex-snapshot
Edmonds polytopes and a hierarchy of combinatorial problems
inferredcites →https://doi.org/10.1287/opre.2.4.393openalex-snapshot
Solution of a Large-Scale Traveling-Salesman Problem
inferredcites →https://doi.org/10.4153/cjm-1967-121-2openalex-snapshot
Cycles and Connectivity in Graphs
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1097-024x(200009)30:11<1325::aid-spe342>3.0.co;2-topenalex-snapshot
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
inferred← citeshttps://doi.org/10.1002/1520-6750(199210)39:6<839::aid-nav3220390609>3.0.co;2-copenalex-snapshot
Partial polyhedral description and generation of discrete optimization problems with known optima
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0949openalex-snapshot
Exact Solution of the Capacitated Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1002/9780470612491.ch9openalex-snapshot
An Overview of Applications
inferred← citeshttps://doi.org/10.1002/nav.20361openalex-snapshot
A branch‐and‐cut algorithm for the nonpreemptive swapping problem
inferred← citeshttps://doi.org/10.1002/nav.3800300107openalex-snapshot
The traveling salesman problem: An update of research
inferred← citeshttps://doi.org/10.1002/net.20307openalex-snapshot
A branch‐and‐cut algorithm for the undirected prize collecting traveling salesman problem
inferred← citeshttps://doi.org/10.1002/net.20447openalex-snapshot
A branch‐and‐cut algorithm for the preemptive swapping problem
inferred← citeshttps://doi.org/10.1007/0-306-48058-1_12openalex-snapshot
Street Routing and Scheduling Problems
inferred← citeshttps://doi.org/10.1007/11496915_33openalex-snapshot
A Study of Domino-Parity and k-Parity Constraints for the TSP
inferred← citeshttps://doi.org/10.1007/11889205_55openalex-snapshot
A Filter for the Circuit Constraint
inferred← citeshttps://doi.org/10.1007/3-540-29297-7_21openalex-snapshot
The Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/3-540-36478-1_13openalex-snapshot
A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytope
inferred← citeshttps://doi.org/10.1007/3-540-47867-1_8openalex-snapshot
Polynomial-Time Separation of Simple Comb Inequalities
inferred← citeshttps://doi.org/10.1007/3-540-48777-8_7openalex-snapshot
On the Separation of Maximally Violated mod-k Cuts
inferred← citeshttps://doi.org/10.1007/3-540-60299-2_35openalex-snapshot
Constraint solving for combinatorial search problems: A tutorial
inferred← citeshttps://doi.org/10.1007/978-1-4613-0301-5_2openalex-snapshot
Branch and Cut Methods for Mixed Integer Linear Programming Problems
inferred← citeshttps://doi.org/10.1007/978-1-4615-5203-1_12openalex-snapshot
Street Routing and Scheduling Problems
inferred← citeshttps://doi.org/10.1007/978-1-4615-5755-5_1openalex-snapshot
Exact Solution of the Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1007/978-2-287-99037-3_21openalex-snapshot
Le probléme du voyageur de commerce
inferred← citeshttps://doi.org/10.1007/978-3-0348-5997-4_10openalex-snapshot
Die Zwiebelstrukturen Einiger Klassen von Kombinatorischen und Graphentheoretischen Problemen
inferred← citeshttps://doi.org/10.1007/978-3-540-68279-0_12openalex-snapshot
Fifty-Plus Years of Combinatorial Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-71844-4_21openalex-snapshot
The Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-72792-7_4openalex-snapshot
Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-540-76919-4_21openalex-snapshot
Das Traveling-Salesman-Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-24488-9_21openalex-snapshot
The Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-25401-7_21openalex-snapshot
Das Traveling-Salesman-Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-52074-7_17openalex-snapshot
Zur Oberflächenstruktur des Travelling Salesman Polytopen
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_13openalex-snapshot
Polyhedral Combinatorics
inferred← citeshttps://doi.org/10.1007/978-3-642-82450-0_3openalex-snapshot
LP-Based Combinatorial Problem Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-95322-4_12openalex-snapshot
On the Symmetric Travelling Salesman Problem: Theory and Computation
inferred← citeshttps://doi.org/10.1007/978-3-662-21708-5_21openalex-snapshot
The Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-21711-5_21openalex-snapshot
The Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-56039-6_21openalex-snapshot
The Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-57691-5_21openalex-snapshot
Das Traveling-Salesman-Problem
inferred← citeshttps://doi.org/10.1007/978-88-470-1523-4_21openalex-snapshot
Il problema del commesso viaggiatore
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_7openalex-snapshot
Acyclic Subdigraphs and Linear Orderings: Polytopes, Facets, and a Cutting Plane Algorithm
inferred← citeshttps://doi.org/10.1007/978-94-011-7557-9_9openalex-snapshot
Some Results on the Convex Hull of the Hamiltonian Cycles of Symetric Complete Graphs
inferred← citeshttps://doi.org/10.1007/bf01580454openalex-snapshot
Partial linear characterizations of the asymmetric travelling salesman polytope
inferred← citeshttps://doi.org/10.1007/bf01580599openalex-snapshot
Polyhedral study of the capacitated vehicle routing problem
inferred← citeshttps://doi.org/10.1007/bf01580849openalex-snapshot
Cutting-plane proofs in polynomial space
inferred← citeshttps://doi.org/10.1007/bf01580858openalex-snapshot
Chvátal closures for mixed integer programming problems
inferred← citeshttps://doi.org/10.1007/bf01581259openalex-snapshot
The graphical relaxation: A new framework for the symmetric traveling salesman polytope
inferred← citeshttps://doi.org/10.1007/bf01582116openalex-snapshot
On the symmetric travelling salesman problem I: Inequalities
inferred← citeshttps://doi.org/10.1007/bf01582117openalex-snapshot
On the symmetric travelling salesman problem II: Lifting theorems and facets
inferred← citeshttps://doi.org/10.1007/bf01582230openalex-snapshot
Sensitivity theorems in integer linear programming
inferred← citeshttps://doi.org/10.1007/bf01585563openalex-snapshot
Worst-case comparison of valid inequalities for the TSP
inferred← citeshttps://doi.org/10.1007/bf01586945openalex-snapshot
The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
inferred← citeshttps://doi.org/10.1007/bf01588786openalex-snapshot
Optimizing over the subtour polytope of the travelling salesman problem
inferred← citeshttps://doi.org/10.1007/bf01721246openalex-snapshot
Recent trends in combinatorial optimization
inferred← citeshttps://doi.org/10.1007/bf01918456openalex-snapshot
Lineare Charakterisierungen von Travelling Salesman Problemen
inferred← citeshttps://doi.org/10.1007/bf02022040openalex-snapshot
Lp-based combinatorial problem solving
inferred← citeshttps://doi.org/10.1007/bf02523689openalex-snapshot
On approximating the longest path in a graph
inferred← citeshttps://doi.org/10.1007/bfb0120887openalex-snapshot
On the symmetric travelling salesman problem: Solution of a 120-city problem
inferred← citeshttps://doi.org/10.1007/bfb0120888openalex-snapshot
On the symmetric travelling salesman problem: A computational study
inferred← citeshttps://doi.org/10.1007/s00373-007-0721-4openalex-snapshot
Vašek Chvátal: A Very Short Introduction
inferred← citeshttps://doi.org/10.1007/s10107-003-0440-4openalex-snapshot
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
inferred← citeshttps://doi.org/10.1007/s10107-012-0516-0openalex-snapshot
Polyhedron of triangle-free simple 2-matchings in subcubic graphs
inferred← citeshttps://doi.org/10.1007/s10107-012-0568-1openalex-snapshot
The symmetric quadratic traveling salesman problem
inferred← citeshttps://doi.org/10.1007/s10107-022-01789-5openalex-snapshot
Complexity of branch-and-bound and cutting planes in mixed-integer optimization
inferred← citeshttps://doi.org/10.1007/s101070100275openalex-snapshot
Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation
inferred← citeshttps://doi.org/10.1007/s10288-003-0012-8openalex-snapshot
Primal separation algorithms
inferred← citeshttps://doi.org/10.1007/s10288-007-0063-3openalex-snapshot
Recent advances in vehicle routing exact algorithms
inferred← citeshttps://doi.org/10.1007/s10479-009-0650-0openalex-snapshot
Exact algorithms for routing problems under vehicle capacity constraints
inferred← citeshttps://doi.org/10.1007/s10479-011-1024-yopenalex-snapshot
Multi-depot Multiple TSP: a polyhedral study and computational results
inferred← citeshttps://doi.org/10.1007/s12532-018-0133-xopenalex-snapshot
Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
inferred← citeshttps://doi.org/10.1016/0012-365x(73)90167-2openalex-snapshot
Edmonds polytopes and a hierarchy of combinatorial problems
inferred← citeshttps://doi.org/10.1016/0012-365x(80)90002-3openalex-snapshot
A matching problem with side conditions
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90068-0openalex-snapshot
The complexity of facets (and some facets of complexity)
inferred← citeshttps://doi.org/10.1016/0024-3795(89)90476-xopenalex-snapshot
On cutting-plane proofs in combinatorial optimization
inferred← citeshttps://doi.org/10.1016/0095-8956(80)90069-6openalex-snapshot
A note on Hamiltonian split graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(87)90039-4openalex-snapshot
On the complexity of cutting-plane proofs
inferred← citeshttps://doi.org/10.1016/0305-0548(83)90030-8openalex-snapshot
Routing and scheduling of vehicles and crews
inferred← citeshttps://doi.org/10.1016/b978-0-12-566780-7.50023-4openalex-snapshot
Polytopes and Complexity
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50032-4openalex-snapshot
10.1016/b978-044488002-4/50032-4
inferred← citeshttps://doi.org/10.1016/j.cor.2015.12.014openalex-snapshot
Generalized multiple depot traveling salesmen problem—Polyhedral study and exact algorithm
inferred← citeshttps://doi.org/10.1016/j.dam.2017.09.009openalex-snapshot
A note on the polytope of bipartite TSP
inferred← citeshttps://doi.org/10.1016/j.dam.2025.06.013openalex-snapshot
Circulant TSP: Vertices of the edge-length polytope and superpolynomial lower bounds
inferred← citeshttps://doi.org/10.1016/j.disc.2006.03.009openalex-snapshot
Edmonds polytopes and a hierarchy of combinatorial problems
inferred← citeshttps://doi.org/10.1016/j.disopt.2007.05.002openalex-snapshot
Exploiting planarity in separation routines for the symmetric traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2007.08.003openalex-snapshot
George Dantzig’s contributions to integer programming
inferred← citeshttps://doi.org/10.1016/j.disopt.2013.07.005openalex-snapshot
A computational comparison of flow formulations for the capacitated location-routing problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2025.100901openalex-snapshot
On the integrality gap of small Asymmetric Traveling Salesman Problems: A polyhedral and computational approach
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.08.034openalex-snapshot
Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm
inferred← citeshttps://doi.org/10.1016/j.ic.2018.08.002openalex-snapshot
Understanding cutting planes for QBFs
inferred← citeshttps://doi.org/10.1016/j.orl.2008.09.006openalex-snapshot
Certification of an optimal TSP tour through 85,900 cities
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70822-7openalex-snapshot
Graph Theory and Integer Programming
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70827-6openalex-snapshot
Travelling Salesman and Assignment Problems: A Survey
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72442-3openalex-snapshot
The Travelling Salesman Polytope and {0, 2}-Matchings
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73235-3openalex-snapshot
Exact Algorithms for the Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1016/s0895-7177(00)00258-2openalex-snapshot
Branch and cut methods for network optimization
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80105-7openalex-snapshot
Chapter 1 Vehicle routing
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80121-5openalex-snapshot
Chapter 4 The traveling salesman problem
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01006-6openalex-snapshot
Chapter V Polyhedral combinatorics
inferred← citeshttps://doi.org/10.1017/s0269888900001041openalex-snapshot
Combining satisfiability techniques from AI and OR
inferred← citeshttps://doi.org/10.1057/jors.1977.181openalex-snapshot
Mathematical Programming Studies
inferred← citeshttps://doi.org/10.1057/jors.2009.76openalex-snapshot
A concise guide to the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1057/s41274-016-0173-4openalex-snapshot
A dual local search framework for combinatorial optimization problems with TSP application
inferred← citeshttps://doi.org/10.1109/icsssm.2006.320764openalex-snapshot
Lower Bounds and an Exact Method for the Capacitated Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1109/sfcs.1980.29openalex-snapshot
On linear characterizations of combinatorial optimization problems
inferred← citeshttps://doi.org/10.1137/0211053openalex-snapshot
On Linear Characterizations of Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1137/0406047openalex-snapshot
An Integer Polytope Related to the Design of Survivable Communication Networks
inferred← citeshttps://doi.org/10.1145/2463596.2463601openalex-snapshot
Solving the simple offset assignment problem as a traveling salesman
inferred← citeshttps://doi.org/10.1145/800070.802199openalex-snapshot
The complexity of facets (and some facets of complexity)
inferred← citeshttps://doi.org/10.1147/rd.284.0476openalex-snapshot
Aspects of the traveling salesman problem
inferred← citeshttps://doi.org/10.1201/b17414-11openalex-snapshot
Multistage Production and Distribution Planning Problems
inferred← citeshttps://doi.org/10.1287/ijoc.1060.0204openalex-snapshot
Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP)
inferred← citeshttps://doi.org/10.1287/ijoc.12.1.2.11900openalex-snapshot
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
inferred← citeshttps://doi.org/10.1287/mnsc.26.5.495openalex-snapshot
Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
inferred← citeshttps://doi.org/10.1287/moor.1060.0214openalex-snapshot
Polynomial-Time Separation of a Superclass of Simple Comb Inequalities
inferred← citeshttps://doi.org/10.1287/moor.1060.0244openalex-snapshot
The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation
inferred← citeshttps://doi.org/10.1287/moor.11.4.537openalex-snapshot
Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1287/moor.1100.0451openalex-snapshot
Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1287/moor.12.3.451openalex-snapshot
Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra
inferred← citeshttps://doi.org/10.1287/moor.16.1.42openalex-snapshot
Facets of the Asymmetric Traveling Salesman Polytope
inferred← citeshttps://doi.org/10.1287/moor.16.2.259openalex-snapshot
Small Travelling Salesman Polytopes
inferred← citeshttps://doi.org/10.1287/moor.17.2.308openalex-snapshot
The Crown Inequalities for the Symmetric Traveling Salesman Polytope
inferred← citeshttps://doi.org/10.1287/moor.17.4.882openalex-snapshot
The Binested Inequalities for the Symmetric Traveling Salesman Polytope
inferred← citeshttps://doi.org/10.1287/moor.2022.1265openalex-snapshot
The Circlet Inequalities: A New, Circulant-Based, Facet-Defining Inequality for the TSP
inferred← citeshttps://doi.org/10.1287/moor.24.1.130openalex-snapshot
Separating Maximally Violated Comb Inequalities in Planar Graphs
inferred← citeshttps://doi.org/10.1287/moor.25.3.443.12213openalex-snapshot
Separating a Superclass of Comb Inequalities in Planar Graphs
inferred← citeshttps://doi.org/10.1287/moor.26.1.19.10593openalex-snapshot
On the Matrix-Cut Rank of Polyhedra
inferred← citeshttps://doi.org/10.1287/moor.26.4.700.10004openalex-snapshot
The Symmetric Traveling Salesman Polytope Revisited
inferred← citeshttps://doi.org/10.1287/moor.5.2.285openalex-snapshot
On the Monotone Symmetric Travelling Salesman Problem: Hypohamiltonian/Hypotraceable Graphs and Facets
inferred← citeshttps://doi.org/10.1287/opre.1040.0111openalex-snapshot
An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
inferred← citeshttps://doi.org/10.1287/trsc.2013.0500openalex-snapshot
A Branch-and-Cut-and-Price Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem
inferred← citeshttps://doi.org/10.47749/t/unicamp.1996.108710openalex-snapshot
Times assincronos para resolução de problemas de otimização combinatoria com multiplas funções objetivo
inferred← citeshttps://doi.org/10.48550/arxiv.1709.01367openalex-snapshot
Simple Necessary Conditions for the Existence of a Hamiltonian Path with Applications to Cactus Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2011.05474openalex-snapshot
Complexity of branch-and-bound and cutting planes in mixed-integer optimization -- II
inferred← citeshttps://doi.org/10.5772/12909openalex-snapshot
Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches
inferred← citeshttps://doi.org/10.5772/547openalex-snapshot
Traveling Salesman Problem, Theory and Applications
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/339openalex-snapshot
LP-based heuristics for the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.70675/22232f00zc154z4403z9ad9zb300629d8110openalex-snapshot
Une approche polyédrale pour le problème du double voyageur de commerce sous contraintes de piles et pour les ordres lexicographiques
inferred← citeshttps://doi.org/10.71781/10668openalex-snapshot
Models and algorithms for the capacitated location-routing problem
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.