Pages that link to "Item:Q5378639"

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

Displaying 50 items.

• Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics (Q1666410) (← links)
• The traveling salesman problem on grids with forbidden neighborhoods (Q1680496) (← links)
• On global integer extrema of real-valued box-constrained multivariate quadratic functions (Q1680502) (← links)
• A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (Q1681265) (← links)
• Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout (Q1681433) (← links)
• A note on the polytope of bipartite TSP (Q1682883) (← links)
• Formulations for the orienteering problem with additional constraints (Q1686508) (← links)
• Rejoinder on: continuous approximation models in freight distribution management (Q1688434) (← links)
• Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
• Crane scheduling in railway yards: an analysis of computational complexity (Q1707828) (← links)
• A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration (Q1711440) (← links)
• The green location-routing problem (Q1722977) (← links)
• Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm (Q1728472) (← links)
• A comparison of algorithms for finding an efficient theme park tour (Q1741683) (← links)
• Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks (Q1751162) (← links)
• Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs (Q1751242) (← links)
• Traveling worker assembly line (re)balancing problem: model, reduction techniques, and real case studies (Q1751911) (← links)
• Inventory rebalancing and vehicle routing in bike sharing systems (Q1752898) (← links)
• A penalized method for multivariate concave least squares with application to productivity analysis (Q1752904) (← links)
• Exact algorithms for the equitable traveling salesman problem (Q1753595) (← links)
• The traveling salesman problem with draft limits (Q1761142) (← links)
• Exact algorithms for the order picking problem (Q1782167) (← links)
• On the integrality ratio of the subtour LP for Euclidean TSP (Q1785291) (← links)
• Algorithm for directing cooperative vehicles of a vehicle routing problem for improving fault-tolerance (Q1787317) (← links)
• A novel list-constrained randomized VND approach in GPU for the traveling thief problem (Q1791955) (← links)
• The rainbow spanning forest problem (Q1797922) (← links)
• Improved approximations for cubic bipartite and cubic TSP (Q1801011) (← links)
• The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints (Q1806889) (← links)
• An optimality cut for mixed integer linear programs (Q1809846) (← links)
• Constrained spanning trees and the traveling salesman problem (Q1823163) (← links)
• Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647) (← links)
• Strong lower bounds for the prize collecting Steiner problem in graphs (Q1827870) (← links)
• Approximate algorithms for the travelling purchaser problem (Q1835850) (← links)
• Determination of optimal path under approach and exit constraints (Q1847171) (← links)
• New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q1886799) (← links)
• Solving the max-cut problem using eigenvalues (Q1900149) (← links)
• Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies (Q1919186) (← links)
• An alternate formulation of the symmetric traveling salesman problem and its properties (Q1962065) (← links)
• Travelling salesman problem in tissue P systems with costs (Q1983010) (← links)
• A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows (Q1984692) (← links)
• Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network (Q1991177) (← links)
• A way to optimally solve a green time-dependent vehicle routing problem with time windows (Q1993575) (← links)
• Models and linearizations for the Traveling Car Renter with passengers (Q1996740) (← links)
• Geometric and LP-based heuristics for angular travelling salesman problems in the plane (Q2003422) (← links)
• A heuristic algorithm for the routing and scheduling problem with time windows: a case study of the automotive industry in Mexico (Q2004887) (← links)
• Multiperiod multi traveling salesmen problem considering time window constraints with an application to a real world case (Q2005780) (← links)
• Polyhedral approximations of the semidefinite cone and their application (Q2028478) (← links)
• Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning (Q2028802) (← links)
• A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows (Q2033323) (← links)
• The power of linear programming: some surprising and unexpected LPs (Q2040605) (← links)