The following pages link to (Q3714900):
Displaying 50 items.
- Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
- Improved integer linear programming formulations for the job sequencing and tool switching problem (Q319452) (← links)
- A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
- Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices (Q337442) (← links)
- On the polyhedral structure of uniform cut polytopes (Q401136) (← links)
- Multiperiod location-routing with decoupled time scales (Q439365) (← links)
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (Q439444) (← links)
- A lexicographic semiorder polytope and probabilistic representations of choice (Q440019) (← links)
- Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem (Q704117) (← links)
- New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141) (← links)
- A spectral approach to polyhedral dimension (Q750306) (← links)
- Optimizing over the subtour polytope of the travelling salesman problem (Q803048) (← links)
- Solution of large-scale symmetric travelling salesman problems (Q810369) (← links)
- A facet generation and relaxation technique applied to an assignment problem with side constraints (Q810374) (← links)
- Canonical equation sets for classes of concordant polytopes (Q811401) (← links)
- On the orthogonal Latin squares polytope (Q819807) (← links)
- Analyzing the Held-Karp TSP bound: A monotonicity property with application (Q912624) (← links)
- Facet identification for the symmetric traveling salesman polytope (Q918865) (← links)
- The wheels of the OLS polytope: Facets and separation (Q932687) (← links)
- Combined route capacity and route length models for unit demand vehicle routing problems (Q951110) (← links)
- A comparative analysis of several asymmetric traveling salesman problem formulations (Q955595) (← links)
- On the completability of incomplete Latin squares (Q966163) (← links)
- Facets of the \((s,t)-p\)-path polytope (Q967368) (← links)
- Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading (Q1046716) (← links)
- Polyhedral proof methods in combinatorial optimization (Q1082268) (← links)
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut (Q1089267) (← links)
- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps'' (Q1109689) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- Polyhedral results for a vehicle routing problem (Q1176821) (← links)
- A spectral method for concordant polyhedral faces (Q1180392) (← links)
- An analytical comparison of different formulations of the travelling salesman problem (Q1181739) (← links)
- Facets of two Steiner arborescence polyhedra (Q1181904) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- Faces with large diameter on the symmetric traveling salesman polytope (Q1200768) (← links)
- The complexity of lifted inequalities for the knapsack problem (Q1201098) (← links)
- Stability aspects of the traveling salesman problem based on \(k\)-best solutions (Q1270780) (← links)
- Clique tree inequalities define facets of the asymmetric traveling salesman polytope (Q1343150) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- The pickup and delivery problem: Faces and branch-and-cut algorithm (Q1368475) (← links)
- Interchange graphs and the Hamiltonian cycle polytope (Q1382266) (← links)
- Some thoughts on combinatorial optimisation (Q1388818) (← links)
- Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. (Q1406627) (← links)
- Partial monotonizations of Hamiltonian cycle polytopes: Dimensions and diameters (Q1582079) (← links)
- A polyhedral approach to sequence alignment problems (Q1585327) (← links)
- Survey of facial results for the traveling salesman polytope (Q1596750) (← links)
- Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm (Q1651623) (← links)
- An exact algorithm for a vehicle-and-driver scheduling problem (Q1652246) (← links)
- Some properties of the skeleton of the pyramidal tours polytope (Q1689899) (← links)
- Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system (Q1751731) (← links)
- The traveling purchaser problem and its variants (Q1751767) (← links)
