New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem (Q537638): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11590-010-0205-y
+Normal rank
@@ Property / OpenAlex ID @@
+W2034550441
@@ Property / OpenAlex ID: W2034550441 / rank @@
+Normal rank
@@ Property / cites work @@
+Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
+Normal rank
@@ Property / cites work @@
+The Traveling Salesman Problem with Many Visits to Few Cities
+Normal rank
@@ Property / cites work @@
+Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs
+Normal rank
@@ Property / cites work @@
+The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
+Normal rank
@@ Property / cites work @@
+On the high multiplicity traveling salesman problem
+Normal rank
@@ Property / cites work @@
+The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
+Normal rank
@@ Property / cites work @@
+Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs
+Normal rank
@@ Property / cites work @@
+Simultaneous lotsizing and scheduling on parallel machines
+Normal rank
@@ Property / cites work @@
+New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
+Normal rank
@@ Property / cites work @@
+A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints
+Normal rank