Pages that link to "Item:Q5378639"

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

Displaying 50 items.

• Memetic algorithm-based path generation for multiple Dubins vehicles performing remote tasks (Q5026663) (← links)
• PathOGiST: A Novel Method for Clustering Pathogen Isolates by Combining Multiple Genotyping Signals (Q5041139) (← links)
• Length-constrained cycle partition with an application to UAV routing* (Q5058406) (← links)
• (Q5075801) (← links)
• Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps (Q5076689) (← links)
• An Exact Method for the Minimum Feedback Arc Set Problem (Q5102057) (← links)
• Coordinating Particle Swarm Optimization, Ant Colony Optimization and K-Opt Algorithm for Traveling Salesman Problem (Q5114991) (← links)
• Hidden Hamiltonian Cycle Recovery via Linear Programming (Q5130484) (← links)
• Solution of a traveling salesman problem in computer component design (Q5184671) (← links)
• Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem (Q5206234) (← links)
• (Q5743492) (← links)
• Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph (Q5870844) (← links)
• Deriving compact extended formulations via LP-based separation techniques (Q5892024) (← links)
• A new integer programming formulation of the graphical traveling salesman problem (Q5918436) (← links)
• Deriving compact extended formulations via LP-based separation techniques (Q5925168) (← links)
• A new integer programming formulation of the graphical traveling salesman problem (Q5925646) (← links)
• A modified subgradient algorithm for Lagrangean relaxation (Q5926608) (← links)
• Branch and cut methods for network optimization (Q5936762) (← links)
• Selection and sequencing heuristics to reduce variance in gas turbine engine nozzle assemblies (Q5939582) (← links)
• On the equivalence of the multistage-insertion and cycle-shrink formulations of the symmetric traveling salesman problem (Q5952070) (← links)
• Inductive linearization for binary quadratic programs with linear constraints (Q6057718) (← links)
• Multidistances and inequality measures on abstract sets: an axiomatic approach (Q6058096) (← links)
• “Make no little plans”: Impactful research to solve the next generation of transportation problems (Q6065303) (← links)
• Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule (Q6065592) (← links)
• The family traveling salesman problem with incompatibility constraints (Q6065853) (← links)
• The <i>r</i>‐interdiction selective multi‐depot vehicle routing problem (Q6067891) (← links)
• Heuristic approaches for the family traveling salesman problem (Q6070420) (← links)
• A biased random-key genetic algorithm for the two-level hub location routing problem with directed tours (Q6073277) (← links)
• A matheuristic algorithm for the pollution and energy minimization traveling salesman problems (Q6079856) (← links)
• Heuristic sequencing methods for time optimal tracking of nested, open and closed paths (Q6084144) (← links)
• The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&amp;‐cut based methods (Q6085888) (← links)
• A 4/3-approximation algorithm for half-integral cycle cut instances of the TSP (Q6086003) (← links)
• Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems (Q6090149) (← links)
• Selective arc‐ng pricing for vehicle routing (Q6092607) (← links)
• Tight lower bounds for the traveling salesman problem with draft limits (Q6109566) (← links)
• Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)
• 0-1 mathematical programming models for flexible process planning (Q6112702) (← links)
• Small and large neighborhood search for the park-and-loop routing problem with parking selection (Q6112711) (← links)
• Adaptive solution prediction for combinatorial optimization (Q6112875) (← links)
• Polyhedral techniques in combinatorial optimization: matchings and tours (Q6118160) (← links)
• Some contributions of Ailsa H. Land to the study of the traveling salesman problem (Q6169992) (← links)
• On the generation of metric TSP instances with a large integrality gap by branch-and-cut (Q6175708) (← links)
• On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm (Q6179695) (← links)
• Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem (Q6180050) (← links)
• A hybrid mathematical model for flying sidekick travelling salesman problem with time windows (Q6200792) (← links)
• Solving large-scale routing optimization problems with networks and only networks (Q6204267) (← links)
• Coordination of cyclic crossover and bat algorithm for the travelling salesman problems in different environments: a simulation approach (Q6535587) (← links)
• An exact decomposition technique for the deadline-constrained discrete time/cost trade-off problem with discounted cash flows (Q6551096) (← links)
• Unified branch-and-Benders-cut for two-stage stochastic mixed-integer programs (Q6551136) (← links)
• Delay-resistant robust vehicle routing with heterogeneous time windows (Q6551164) (← links)