Pages that link to "Item:Q5378639"

The following pages link to Solution of a Large-Scale Traveling-Salesman Problem (Q5378639):

Displaying 50 items.

• The minimum flow cost Hamiltonian cycle problem: a comparison of formulations (Q2348064) (← links)
• Generating subtour elimination constraints for the TSP from pure integer solutions (Q2358189) (← links)
• Subadditive approaches in integer programming (Q2371344) (← links)
• A branch and cut algorithm for the hierarchical network design problem (Q2379520) (← links)
• Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394) (← links)
• Decomposition theorems for square-free 2-matchings in bipartite graphs (Q2410265) (← links)
• Dual track and segmented single track bidirectional loop guidepath layout for AGV systems (Q2426526) (← links)
• The symmetric quadratic traveling salesman problem (Q2434982) (← links)
• Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618) (← links)
• The significance of deterministic empty vehicle trips in the design of a unidirectional loop flow path (Q2459390) (← links)
• A travelling salesman problem (TSP) with multiple job facilities. (Q2467832) (← links)
• Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
• The single vehicle routing problem with deliveries and selective pickups (Q2475847) (← links)
• Multilocus consensus genetic maps (MCGM): Formulation, algorithms, and results (Q2490509) (← links)
• A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q2494810) (← links)
• On pedigree polytopes and Hamiltonian cycles (Q2497514) (← links)
• Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? (Q2514734) (← links)
• Transformation of integer programs to knapsack problems (Q2547181) (← links)
• Low-complexity algorithms for sequencing jobs with a fixed number of job-classes (Q2564755) (← links)
• Uncertain multiobjective traveling salesman problem (Q2629690) (← links)
• Mathematical formulations for a 1-full-truckload pickup-and-delivery problem (Q2630253) (← links)
• Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics (Q2636833) (← links)
• A mathematical model for supply chain management of blood banks in India (Q2656515) (← links)
• The traveling salesman problem with job-times (\textit{TSPJ}) (Q2668643) (← links)
• Reinforcement learning for combinatorial optimization: a survey (Q2669503) (← links)
• Visual attractiveness in vehicle routing via bi-objective optimization (Q2669616) (← links)
• An LP-based approximation algorithm for the generalized traveling salesman path problem (Q2680860) (← links)
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
• A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions (Q2688908) (← links)
• Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem (Q2689288) (← links)
• SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
• Reassembling trees for the traveling salesman (Q2806177) (← links)
• The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme (Q2817793) (← links)
• Discrete optimization methods to determine trajectories for Dubins' vehicles (Q2883544) (← links)
• Edge Elimination in TSP Instances (Q2945197) (← links)
• Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries (Q2948920) (← links)
• Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes (Q2959185) (← links)
• A New Formulation for the Travelling Salesman Problem (Q3315280) (← links)
• On Pedigree Polytopes and Hamiltonian Cycles (Q3439015) (← links)
• From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods (Q3564370) (← links)
• Solving Large-Scale Tour Scheduling Problems (Q4320779) (← links)
• On the Skeleton of the Polytope of Pyramidal Tours (Q4553641) (← links)
• The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem (Q4577740) (← links)
• Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem (Q4596148) (← links)
• A general system for heuristic minimization of convex functions over non-convex sets (Q4638917) (← links)
• The Solution of Travelling Salesman Problems Based on Industrial Data (Q4834258) (← links)
• Development and implementation of algorithms for vehicle routing during a no-notice evacuation (Q4966752) (← links)
• The capacitated m two node survivable star problem (Q4987700) (← links)
• A Memetic Random Key Algorithm for the Balanced Travelling Salesman Problem (Q5011675) (← links)
• A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem (Q5011677) (← links)