Pages that link to "Item:Q2514734"

The following pages link to Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? (Q2514734):

Displaying 22 items.

• Strong multi-commodity flow formulations for the asymmetric traveling salesman problem (Q724060) (← links)
• Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (Q1681305) (← links)
• A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
• Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
• Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the asymmetric traveling salesman problem (Q1728250) (← links)
• Clustering data that are graph connected (Q1753555) (← links)
• A branch-and-price procedure for clustering data that are graph connected (Q2060392) (← links)
• Circular Jaccard distance based multi-solution optimization for traveling salesman problems (Q2086823) (← links)
• A location-or-routing problem with partial and decaying coverage (Q2108134) (← links)
• A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings (Q2178909) (← links)
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints (Q2276891) (← links)
• A branch-and-cut algorithm for an assembly routing problem (Q2286876) (← links)
• A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions (Q2688908) (← links)
• Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule (Q6065592) (← links)
• 0-1 mathematical programming models for flexible process planning (Q6112702) (← links)
• A multi-objective location-routing model for dental waste considering environmental factors (Q6179195) (← links)
• The hazardous orienteering problem (Q6179713) (← links)
• Connected graph partitioning with aggregated and non‐aggregated gap objective functions (Q6180037) (← links)
• Integer programming formulations for the \(k\)-in-a-tree problem in graphs (Q6495390) (← links)
• Mathematical formulations for consistent travelling salesman problems (Q6555132) (← links)
• General VNS for asymmetric vehicle routing problem with time and capacity constraints (Q6568438) (← links)
• Fleet resupply by drones for last-mile delivery (Q6586265) (← links)