Pages that link to "Item:Q3281501"

The following pages link to Integer Programming Formulation of Traveling Salesman Problems (Q3281501):

Displaying 50 items.

• A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem (Q596294) (← links)
• The orienteering problem: a survey (Q617509) (← links)
• Data transfer planning with tree placement for collaborative environments (Q647480) (← links)
• A multi-criteria optimization model for humanitarian aid distribution (Q652675) (← links)
• Solving the minimum label spanning tree problem by mathematical programming techniques (Q666399) (← links)
• The multiple-robot assembly plan problem (Q685191) (← links)
• Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
• New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141) (← links)
• MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
• The indefinite period traveling salesman problem (Q724039) (← links)
• Strong multi-commodity flow formulations for the asymmetric traveling salesman problem (Q724060) (← links)
• The multi-vehicle probabilistic covering tour problem (Q724092) (← links)
• Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints (Q733522) (← links)
• Concurrent optimization of harvesting and road network layouts under steep terrain (Q748552) (← links)
• Integer linear programming formulation for a vehicle routing problem (Q804473) (← links)
• Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
• Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
• An improved binary programming formulation for the secure domination problem (Q828823) (← links)
• Optimization of wireless sensor networks deployment with coverage and connectivity constraints (Q829179) (← links)
• Optimal solutions to minimum total energy broadcasting problem in wireless ad hoc networks (Q857761) (← links)
• Heuristic and lower bound for a stochastic location-routing problem (Q864014) (← links)
• Competitiveness based on logistic management: a real case study (Q889527) (← links)
• Lower bounds on the sizes of integer programs without additional variables (Q896270) (← links)
• Classification of travelling salesman problem formulations (Q911990) (← links)
• Cost allocation: The traveling salesman, bin packing, and the knapsack (Q922949) (← links)
• Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search (Q926338) (← links)
• A comparative analysis of several asymmetric traveling salesman problem formulations (Q955595) (← links)
• An efficient optimal solution to the coil sequencing problem in electro-galvanizing line (Q976044) (← links)
• The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675) (← links)
• Industrial aspects and literature survey: fleet composition and routing (Q991360) (← links)
• A framework for multi-robot node coverage in sensor networks (Q1022471) (← links)
• A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem (Q1026674) (← links)
• A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars (Q1038386) (← links)
• An optimization-based heuristic for the robotic cell problem (Q1040983) (← links)
• Methods for routing with time windows (Q1068008) (← links)
• The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm (Q1083379) (← links)
• The pickup and delivery problem with time windows (Q1179004) (← links)
• An analytical comparison of different formulations of the travelling salesman problem (Q1181739) (← links)
• The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
• On symmetric subtour problems (Q1202764) (← links)
• Integer programming formulation of combinatorial optimization problems (Q1239086) (← links)
• An approach for solving a class of transportation scheduling problems (Q1251987) (← links)
• Optimal multiple stage expansion of competence set (Q1579487) (← links)
• Use of the BATA algorithm and MIS to solve the mail carrier problem (Q1614192) (← links)
• Scheduling electric vehicles and locating charging stations on a path (Q1617297) (← links)
• A matheuristic approach to the orienteering problem with service time dependent profits (Q1622800) (← links)
• Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times (Q1628056) (← links)
• Computational approaches for zero forcing and related problems (Q1631510) (← links)
• The time constrained maximal covering salesman problem (Q1631991) (← links)
• Evaluating the quality of online optimization algorithms by discrete event simulation (Q1642796) (← links)