On the public citation graph
The traveling salesman problem on a graph and some related integer polyhedra
0 signed · 270 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.1002/net.3230130202openalex-snapshot
Steiner trees, partial 2–trees, and minimum IFI networks
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/bf01580734openalex-snapshot
A new class of cutting planes for the symmetric travelling salesman problem
inferredcites →https://doi.org/10.1007/bf01582116openalex-snapshot
On the symmetric travelling salesman problem I: Inequalities
inferredcites →https://doi.org/10.1007/bf01582117openalex-snapshot
On the symmetric travelling salesman problem II: Lifting theorems and facets
inferredcites →https://doi.org/10.1007/bf02591867openalex-snapshot
Halin graphs and the travelling salesman problem
inferredcites →https://doi.org/10.1016/0304-3975(82)90059-7openalex-snapshot
On the relationship between the biconnectivity augmentation and travelling salesman problems
inferredcites →https://doi.org/10.1145/322326.322328openalex-snapshot
Linear-time computability of combinatorial problems on series-parallel graphs
inferredcites →https://doi.org/10.1287/opre.31.3.507openalex-snapshot
Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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/net.20072openalex-snapshot
Design of Survivable Networks: A survey
inferred← citeshttps://doi.org/10.1002/net.20176openalex-snapshot
A branch & cut algorithm for the windy general routing problem and special cases
inferred← citeshttps://doi.org/10.1002/net.20289openalex-snapshot
Approximating the smallest k‐edge connected spanning subgraph by LP‐rounding
inferred← citeshttps://doi.org/10.1002/net.20310openalex-snapshot
A branch‐and‐cut algorithm for the k‐edge connected subgraph problem
inferred← citeshttps://doi.org/10.1002/net.20347openalex-snapshot
Recent results on Arc Routing Problems: An annotated bibliography
inferred← citeshttps://doi.org/10.1002/net.21808openalex-snapshot
Vehicle routing problems with road‐network information: State of the art
inferred← citeshttps://doi.org/10.1002/net.22119openalex-snapshot
Improving a constructive heuristic for the general routing problem
inferred← citeshttps://doi.org/10.1002/net.3230220106openalex-snapshot
The n‐line traveling salesman problem
inferred← citeshttps://doi.org/10.1007/11496915_34openalex-snapshot
Not Every GTSP Facet Induces an STSP Facet
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_130openalex-snapshot
A polynomial-time algorithm for subgraph isomorphism of two-connected series-parallel graphs
inferred← citeshttps://doi.org/10.1007/3-540-45586-8_7openalex-snapshot
TSP Cuts Which Do Not Conform to the Template Paradigm
inferred← citeshttps://doi.org/10.1007/3-540-48777-8_13openalex-snapshot
Critical Extreme Points of the 2-Edge Connected Spannning Subgraph Polytope
inferred← citeshttps://doi.org/10.1007/978-0-387-30165-5_15openalex-snapshot
Polyhedral Approaches to the Design of Survivable Networks
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_217openalex-snapshot
General Routing Problem
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_57openalex-snapshot
Dual Integrality in Combinatorial Optimization
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-4495-1_6openalex-snapshot
Polyhedral Theory for Arc Routing Problems
inferred← citeshttps://doi.org/10.1007/978-1-4615-4495-1_7openalex-snapshot
Linear Programming Based Methods for Solving Arc Routing Problems
inferred← citeshttps://doi.org/10.1007/978-1-4615-4567-5_5openalex-snapshot
Solving General Ring Network Design Problems by Meta-Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-030-05453-3_13openalex-snapshot
Integrated Route, Charging and Activity Planning for Whole Day Mobility with Electric Vehicles
inferred← citeshttps://doi.org/10.1007/978-3-030-53262-8_3openalex-snapshot
On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-53262-8_6openalex-snapshot
On the Multiple Steiner Traveling Salesman Problem with Order Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-64018-7_7openalex-snapshot
Topology-Constrained Network Design
inferred← citeshttps://doi.org/10.1007/978-3-030-73879-2_32openalex-snapshot
A New Integer Programming Formulation of the Graphical Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-06901-7_5openalex-snapshot
A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-50273-6_4openalex-snapshot
Order Batches Approaches in Warehouses with Low-Level Picker-to-Parts Systems: A Practical Perspective on Picking Optimization Methods
inferred← citeshttps://doi.org/10.1007/978-3-032-28691-8_9openalex-snapshot
The Integrality Gap of the Traveling Salesman Problem is $$\frac{4}{3}$$ if the LP Solution Has at Most $$n + 6$$ Non-Zero Components
inferred← citeshttps://doi.org/10.1007/978-3-319-12340-0_26openalex-snapshot
Graph-TSP from Steiner Cycles
inferred← citeshttps://doi.org/10.1007/978-3-319-45587-7_8openalex-snapshot
Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories
inferred← citeshttps://doi.org/10.1007/978-3-319-78455-7_16openalex-snapshot
Single Vehicle’s Package Delivery Strategy with Online Traffic Congestion of Certain Delay Time
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_2openalex-snapshot
Facet Generating Techniques
inferred← citeshttps://doi.org/10.1007/978-3-642-13036-6_29openalex-snapshot
Hypergraphic LP Relaxations for Steiner Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-14883-5_81openalex-snapshot
Solving the General Routing Problem by Artificial Ants
inferred← citeshttps://doi.org/10.1007/978-3-642-15286-3_25openalex-snapshot
Solving the Capacitated Vehicle Routing Problem and the Split Delivery Using GRASP Metaheuristic
inferred← citeshttps://doi.org/10.1007/978-3-642-18318-8_20openalex-snapshot
k-Edge-Connectivity: Approximation and LP Relaxation
inferred← citeshttps://doi.org/10.1007/978-3-642-20807-2_6openalex-snapshot
TSP on Cubic and Subcubic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-36694-9_31openalex-snapshot
Eight-Fifth Approximation for the Path TSP
inferred← citeshttps://doi.org/10.1007/978-3-642-73778-7_162openalex-snapshot
Cutting Planes for the Symmetric Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_61openalex-snapshot
An Improved Analysis of the Mömke--Svensson Algorithm for Graph-TSP on Subquartic Graphs
inferred← citeshttps://doi.org/10.1007/978-981-96-1090-7_18openalex-snapshot
1.6-Approximation Algorithm for Generalized Traveling Salesman Path Problem
inferred← citeshttps://doi.org/10.1007/bf01545526openalex-snapshot
On approximately fair cost allocation in Euclidean TSP games
inferred← citeshttps://doi.org/10.1007/bf01580599openalex-snapshot
Polyhedral study of the capacitated vehicle routing problem
inferred← citeshttps://doi.org/10.1007/bf01580734openalex-snapshot
A new class of cutting planes for the symmetric travelling salesman problem
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/bf01581260openalex-snapshot
Hamiltonian path and symmetric travelling salesman polytopes
inferred← citeshttps://doi.org/10.1007/bf01581274openalex-snapshot
A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets
inferred← citeshttps://doi.org/10.1007/bf01582064openalex-snapshot
The Steiner tree polytope and related polyhedra
inferred← citeshttps://doi.org/10.1007/bf01582572openalex-snapshot
Two-edge connected spanning subgraphs and polyhedra
inferred← citeshttps://doi.org/10.1007/bf01582573openalex-snapshot
The Steiner tree problem I: Formulations, compositions and extension of facets
inferred← citeshttps://doi.org/10.1007/bf01582574openalex-snapshot
The Steiner tree problem II: Properties and classes of facets
inferred← citeshttps://doi.org/10.1007/bf01585563openalex-snapshot
Worst-case comparison of valid inequalities for the TSP
inferred← citeshttps://doi.org/10.1007/bf01585700openalex-snapshot
The traveling salesman problem in graphs with some excluded minors
inferred← citeshttps://doi.org/10.1007/bf01585735openalex-snapshot
Minimum-weight two-connected spanning networks
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/pl00011426openalex-snapshot
A cutting plane algorithm for the General Routing Problem
inferred← citeshttps://doi.org/10.1007/s00224-012-9439-7openalex-snapshot
$\frac{13}{9}$ -Approximation for Graphic TSP
inferred← citeshttps://doi.org/10.1007/s00291-020-00594-wopenalex-snapshot
Online routing and scheduling of search-and-rescue teams
inferred← citeshttps://doi.org/10.1007/s00291-024-00760-4openalex-snapshot
The single picker routing problem with scattered storage: modeling and evaluation of routing and storage policies
inferred← citeshttps://doi.org/10.1007/s00493-011-2960-3openalex-snapshot
Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs
inferred← citeshttps://doi.org/10.1007/s00493-014-2960-3openalex-snapshot
Shorter tours by nicer ears: 7/5-Approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs
inferred← citeshttps://doi.org/10.1007/s00500-020-05043-yopenalex-snapshot
The Multiple Steiner TSP with order constraints: complexity and optimization algorithms
inferred← citeshttps://doi.org/10.1007/s10107-003-0391-9openalex-snapshot
The mixed general routing polyhedron
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-005-0643-yopenalex-snapshot
Zigzag inequalities: a new class of facet-inducing inequalities for Arc Routing Problems
inferred← citeshttps://doi.org/10.1007/s10107-005-0654-8openalex-snapshot
Critical extreme points of the 2-edge connected spanning subgraph polytope
inferred← citeshttps://doi.org/10.1007/s10107-006-0046-8openalex-snapshot
Traveling salesman path problems
inferred← citeshttps://doi.org/10.1007/s10107-006-0060-xopenalex-snapshot
On the graphical relaxation of the symmetric traveling salesman polytope
inferred← citeshttps://doi.org/10.1007/s10107-007-0205-6openalex-snapshot
Packing circuits in matroids
inferred← citeshttps://doi.org/10.1007/s10107-014-0855-0openalex-snapshot
Lower bounds on the sizes of integer programs without additional variables
inferred← citeshttps://doi.org/10.1007/s10107-021-01743-xopenalex-snapshot
Box-total dual integrality and edge-connectivity
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/s10107-022-01849-wopenalex-snapshot
A new integer programming formulation of the graphical traveling salesman problem
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/s101070100276openalex-snapshot
Efficient separation routines for the symmetric traveling salesman problem II: separating multi handle inequalities
inferred← citeshttps://doi.org/10.1007/s10288-007-0036-6openalex-snapshot
A survey on the linear ordering problem for weighted or unweighted tournaments
inferred← citeshttps://doi.org/10.1007/s10288-015-0292-9openalex-snapshot
Light on the infinite group relaxation I: foundations and taxonomy
inferred← citeshttps://doi.org/10.1007/s10288-015-0293-8openalex-snapshot
Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms
inferred← citeshttps://doi.org/10.1007/s10479-009-0648-7openalex-snapshot
An updated survey on the linear ordering problem for weighted or unweighted tournaments
inferred← citeshttps://doi.org/10.1007/s10479-024-06003-7openalex-snapshot
A Branch-and-Cut algorithm for the multiple Steiner TSP with order constraints
inferred← citeshttps://doi.org/10.1007/s10696-011-9101-8openalex-snapshot
Joint order batching and picker routing in single and multiple-cross-aisle warehouses using cluster-based tabu search algorithms
inferred← citeshttps://doi.org/10.1007/s10696-026-09665-6openalex-snapshot
An effective heuristic algorithm for void fills insertion in e-commerce parcel boxes: a smart packaging system
inferred← citeshttps://doi.org/10.1007/s10878-005-1777-9openalex-snapshot
The 2-Edge-Connected Subgraph Polyhedron
inferred← citeshttps://doi.org/10.1007/s10878-007-9134-9openalex-snapshot
Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron
inferred← citeshttps://doi.org/10.1007/s10878-017-0159-4openalex-snapshot
ILP formulation of the degree-constrained minimum spanning hierarchy problem
inferred← citeshttps://doi.org/10.1007/s44425-025-00029-0openalex-snapshot
Complexity on Paths for the Graphical TSP with Release Dates
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90123-bopenalex-snapshot
The anti-join composition and polyhedra
inferred← citeshttps://doi.org/10.1016/0166-218x(92)00035-kopenalex-snapshot
Arborescence polytopes for series-parallel graphs
inferred← citeshttps://doi.org/10.1016/0167-6377(92)90055-8openalex-snapshot
On the convex hull of feasible solutions to certain combinatorial problems
inferred← citeshttps://doi.org/10.1016/0167-6377(96)00015-6openalex-snapshot
k-edge connected polyhedra on series-parallel graphs
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90398-0openalex-snapshot
A polyhedral approach to the rural postman problem
inferred← citeshttps://doi.org/10.1016/j.cie.2017.03.007openalex-snapshot
The survivable k-node-connected network design problem: Valid inequalities and Branch-and-Cut
inferred← citeshttps://doi.org/10.1016/j.cie.2020.106919openalex-snapshot
Retail facility layout considering shopper path
inferred← citeshttps://doi.org/10.1016/j.cor.2006.03.025openalex-snapshot
Good triangulations yield good tours
inferred← citeshttps://doi.org/10.1016/j.cor.2014.06.022openalex-snapshot
Pricing routines for vehicle routing with time windows on road networks
inferred← citeshttps://doi.org/10.1016/j.cor.2015.12.013openalex-snapshot
The Steiner traveling salesman problem with online advanced edge blockages
inferred← citeshttps://doi.org/10.1016/j.cor.2017.06.024openalex-snapshot
Empirical analysis for the VRPTW with a multigraph representation for the road network
inferred← citeshttps://doi.org/10.1016/j.cor.2018.07.002openalex-snapshot
Exact algorithms for the order picking problem
inferred← citeshttps://doi.org/10.1016/j.cor.2018.11.001openalex-snapshot
Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows
inferred← citeshttps://doi.org/10.1016/j.cor.2020.105197openalex-snapshot
Vehicle routing on road networks: How good is Euclidean approximation?
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106321openalex-snapshot
Upgrading edges in the Graphical TSP
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106482openalex-snapshot
Theoretical and computational analysis of a new formulation for the Rural Postman Problem and the General Routing Problem
inferred← citeshttps://doi.org/10.1016/j.dam.2007.04.025openalex-snapshot
On the general routing polytope
inferred← citeshttps://doi.org/10.1016/j.dam.2008.05.001openalex-snapshot
The box-TDI system associated with 2-edge connected spanning subgraphs
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.2004.08.017openalex-snapshot
On survivable network polyhedra
inferred← citeshttps://doi.org/10.1016/j.disopt.2010.05.001openalex-snapshot
The k edge-disjoint 3-hop-constrained paths polytope
inferred← citeshttps://doi.org/10.1016/j.disopt.2011.05.002openalex-snapshot
Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices
inferred← citeshttps://doi.org/10.1016/j.disopt.2013.12.003openalex-snapshot
On the facial structure of Symmetric and Graphical Traveling Salesman Polyhedra
inferred← citeshttps://doi.org/10.1016/j.disopt.2015.04.001openalex-snapshot
Circuit and bond polytopes on series–parallel graphs
inferred← citeshttps://doi.org/10.1016/j.ejco.2021.100004openalex-snapshot
The Steiner bi-objective shortest path problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.07.009openalex-snapshot
Design and control of warehouse order picking: A literature review
inferred← citeshttps://doi.org/10.1016/j.ejor.2009.01.036openalex-snapshot
Using a TSP heuristic for routing order pickers in warehouses
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.01.044openalex-snapshot
Compact formulations of the Steiner Traveling Salesman Problem and related problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.11.013openalex-snapshot
The Steiner Traveling Salesman Problem with online edge blockages
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.02.044openalex-snapshot
The Steiner travelling salesman problem with correlated costs
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.06.074openalex-snapshot
An algorithm for dynamic order-picking in warehouse operations
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.03.069openalex-snapshot
Optimally solving the joint order batching and picker routing problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.11.037openalex-snapshot
A discrete cross aisle design model for order-picking warehouses
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.03.012openalex-snapshot
Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.04.047openalex-snapshot
The Steiner Traveling Salesman Problem and its extensions
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.01.059openalex-snapshot
An efficient and general approach for the joint order batching and picker routing problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.09.012openalex-snapshot
On the Distance-Constrained Close Enough Arc Routing Problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.11.040openalex-snapshot
A capacitated multi-vehicle covering tour problem on a road network and its application to waste collection
inferred← citeshttps://doi.org/10.1016/j.ijpe.2023.109074openalex-snapshot
Learning efficient in-store picking strategies to reduce customer encounters in omnichannel retail
inferred← citeshttps://doi.org/10.1016/j.ins.2016.09.043openalex-snapshot
Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106177openalex-snapshot
An asymptotically tight online algorithm for m-Steiner Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.09.013openalex-snapshot
On matrices with the Edmonds–Johnson property arising from bidirected graphs
inferred← citeshttps://doi.org/10.1016/j.jii.2025.100993openalex-snapshot
A literature review and bibliometric analysis of 50 years of optimization approaches applied to the order batching problem
inferred← citeshttps://doi.org/10.1016/j.jmsy.2022.08.006openalex-snapshot
A comprehensive review of batching problems in low-level picker-to-parts systems with order due dates: Main gaps, trade-offs, and prospects for future research
inferred← citeshttps://doi.org/10.1016/j.laa.2003.11.007openalex-snapshot
The k-edge connected subgraph problem I: Polytopes and critical extreme points
inferred← citeshttps://doi.org/10.1016/j.orl.2021.06.015openalex-snapshot
The Graphical Traveling Salesperson Problem has no integer programming formulation in the original space
inferred← citeshttps://doi.org/10.1016/j.sorms.2010.06.001openalex-snapshot
Approximation algorithms for network design: A survey
inferred← citeshttps://doi.org/10.1016/j.trb.2019.02.008openalex-snapshot
The multi-objective Steiner pollution-routing problem on congested urban road networks
inferred← citeshttps://doi.org/10.1016/j.trc.2023.104144openalex-snapshot
An integrated assignment, routing, and speed model for roadway mobility and transportation with environmental, efficiency, and service goals
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00004-0openalex-snapshot
On perfectly two-edge connected graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00203-1openalex-snapshot
Partial monotonizations of Hamiltonian cycle polytopes: dimensions and diameters
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00306-1openalex-snapshot
On the dominant of the Steiner 2-edge connected subgraph polytope
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00311-5openalex-snapshot
Steiner trees and polyhedra
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00060-2openalex-snapshot
Weighted connected domination and Steiner trees in distance-hereditary graphs
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00337-2openalex-snapshot
The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00346-3openalex-snapshot
New inequalities for the General Routing Problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00377-9openalex-snapshot
The general routing polyhedron: A unifying framework
inferred← citeshttps://doi.org/10.1016/s0377-2217(98)00175-1openalex-snapshot
Submodularity and the traveling salesman 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/s0895-7177(98)00041-7openalex-snapshot
Survey of facial results for the traveling salesman polytope
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(05)80127-6openalex-snapshot
Chapter 10 Design of survivable networks
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01006-6openalex-snapshot
Chapter V Polyhedral combinatorics
inferred← citeshttps://doi.org/10.1017/cbo9780511921735openalex-snapshot
The Design of Approximation Algorithms
inferred← citeshttps://doi.org/10.1017/cbo9780511977152openalex-snapshot
Iterative Methods in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1023/a:1009893108387openalex-snapshot
Steiner k-Edge Connected Subgraph Polyhedra
inferred← citeshttps://doi.org/10.1051/ro:2008022openalex-snapshot
On the Steiner 2-edge connected subgraph polytope
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.1080/00207543.2018.1489154openalex-snapshot
Order picking in parallel-aisle warehouses with multiple blocks: complexity and a graph theory-based heuristic
inferred← citeshttps://doi.org/10.1080/00207543.2022.2149872openalex-snapshot
Improved formulations of the joint order batching and picker routing problem
inferred← citeshttps://doi.org/10.1080/02331930600711976openalex-snapshot
On the facets and diameter of thek-cycle polytope
inferred← citeshttps://doi.org/10.1090/s0002-9939-1995-1260169-4openalex-snapshot
Characterizations of naturally submodular graphs: a polynomially solvable class of the TSP
inferred← citeshttps://doi.org/10.1109/access.2020.3017132openalex-snapshot
Split Demand One-to-One Pickup and Delivery Problems With the Shortest-Path Transport Along Real-Life Paths
inferred← citeshttps://doi.org/10.1109/codit.2019.8820661openalex-snapshot
A layered compact formulation for the Multiple Steiner TSP with Order constraints
inferred← citeshttps://doi.org/10.1109/drcn.2007.4762290openalex-snapshot
The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut
inferred← citeshttps://doi.org/10.1109/focs.2006.48openalex-snapshot
Minimum Bounded Degree Spanning Trees
inferred← citeshttps://doi.org/10.1109/focs.2011.56openalex-snapshot
Approximating Graphic TSP by Matchings
inferred← citeshttps://doi.org/10.1109/tpds.2007.70807openalex-snapshot
Implementation of Distributed Floor Control Protocols on Overlay Networks
inferred← citeshttps://doi.org/10.1111/itor.12419openalex-snapshot
A GRASP heuristic using path‐relinking and restarts for the Steiner traveling salesman problem
inferred← citeshttps://doi.org/10.1111/itor.12592openalex-snapshot
A note on computational aspects of the Steiner traveling salesman problem
inferred← citeshttps://doi.org/10.1137/0403043openalex-snapshot
Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
inferred← citeshttps://doi.org/10.1137/0405024openalex-snapshot
Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems
inferred← citeshttps://doi.org/10.1137/040607307openalex-snapshot
Transformation of Facets of the General Routing Problem Polytope
inferred← citeshttps://doi.org/10.1137/050640886openalex-snapshot
The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
inferred← citeshttps://doi.org/10.1137/0802024openalex-snapshot
Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch6openalex-snapshot
Designing Networks with Good Equilibria under Uncertainty
inferred← citeshttps://doi.org/10.1137/1.9781611975994.140openalex-snapshot
A PTAS for subset TSP in minor-free graphs
inferred← citeshttps://doi.org/10.1137/110845793openalex-snapshot
Hypergraphic LP Relaxations for Steiner Trees
inferred← citeshttps://doi.org/10.1137/15m1010555openalex-snapshot
Cut Dominants and Forbidden Minors
inferred← citeshttps://doi.org/10.1137/16m1096694openalex-snapshot
Designing Networks with Good Equilibria under Uncertainty
inferred← citeshttps://doi.org/10.1137/19m1259353openalex-snapshot
An Improved Analysis of the Mömke--Svensson Algorithm for Graph-TSP on Subquartic Graphs (Journal Version)
inferred← citeshttps://doi.org/10.1137/s0036144596297514openalex-snapshot
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
inferred← citeshttps://doi.org/10.1137/s089548019122232xopenalex-snapshot
The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities
inferred← citeshttps://doi.org/10.1137/s0895480191222665openalex-snapshot
The k -Edge-Connected Spanning Subgraph Polyhedron
inferred← citeshttps://doi.org/10.1137/s0895480193259813openalex-snapshot
Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs
inferred← citeshttps://doi.org/10.1137/s1052623400322287openalex-snapshot
The Steiner Traveling Salesman Polytope and Related Polyhedra
inferred← citeshttps://doi.org/10.1142/s0219198901000415openalex-snapshot
GENERALISATIONS OF THE GILMORE-GOMORY TRAVELING SALESMAN PROBLEM AND THE GILMORE-GOMORY SCHEME: A SURVEY
inferred← citeshttps://doi.org/10.1145/1250790.1250887openalex-snapshot
Approximating minimum bounded degree spanning trees to within one of optimal
inferred← citeshttps://doi.org/10.1145/1374376.1374486openalex-snapshot
Additive guarantees for degree bounded directed network design
inferred← citeshttps://doi.org/10.1145/174147.169803openalex-snapshot
Dynamic programming and the graphical traveling salesman problem
inferred← citeshttps://doi.org/10.1145/2629366openalex-snapshot
Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
inferred← citeshttps://doi.org/10.1145/2739008openalex-snapshot
Removing and Adding Edges for the Traveling Salesman Problem
showing the first 200 of 259 · page through all 259
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.