Pages that link to "Item:Q3281501"

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

Displaying 50 items.

• Compact formulations of the Steiner traveling salesman problem and related problems (Q257227) (← links)
• A new formulation approach for location-routing problems (Q264241) (← links)
• Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
• The multiple vehicle pickup and delivery problem with LIFO constraints (Q319195) (← links)
• A matheuristic for the team orienteering arc routing problem (Q319589) (← links)
• Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem (Q319657) (← links)
• The traveling salesman problem with time-dependent service times (Q320683) (← links)
• A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
• Core-based cost allocation in the cooperative traveling salesman problem (Q320807) (← links)
• Thirty years of heterogeneous vehicle routing (Q320861) (← links)
• Optimal design of compact and functionally contiguous conservation management areas (Q322808) (← links)
• Integer programming formulations for the elementary shortest path problem (Q322844) (← links)
• A new mathematical programming formulation for the single-picker routing problem (Q323113) (← links)
• Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
• A survey on single crane scheduling in automated storage/retrieval systems (Q323403) (← links)
• Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← links)
• An optimal path planning problem for heterogeneous multi-vehicle systems (Q326212) (← links)
• Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles (Q336550) (← links)
• GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743) (← links)
• Looking for edge-equitable spanning trees (Q336753) (← links)
• A branch-and-bound algorithm for the acyclic partitioning problem (Q336782) (← links)
• A hierarchical compromise model for the joint optimization of recovery operations and distribution of emergency goods in Humanitarian logistics (Q336844) (← links)
• The dynamic multiperiod vehicle routing problem with probabilistic information (Q337038) (← links)
• Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (Q337114) (← links)
• Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations (Q337182) (← links)
• Model-based automatic neighborhood design by unsupervised learning (Q337347) (← links)
• The production routing problem: a review of formulations and solution algorithms (Q337418) (← links)
• A bi-objective model for the used oil location-routing problem (Q337643) (← links)
• History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence (Q342093) (← links)
• Solution algorithms for synchronous flow shop problems with two dominating machines (Q342451) (← links)
• The load-balanced multi-dimensional bin-packing problem (Q342477) (← links)
• The coastal seaspace patrol sector design and allocation problem (Q395695) (← links)
• A hybrid algorithm for the DNA sequencing problem (Q406500) (← links)
• New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
• An investigation into two bin packing problems with ordering and orientation implications (Q421577) (← links)
• Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing (Q421709) (← links)
• Multiperiod location-routing with decoupled time scales (Q439365) (← links)
• The stop-and-drop problem in nonprofit food distribution networks (Q478060) (← links)
• An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (Q486397) (← links)
• A randomized granular tabu search heuristic for the split delivery vehicle routing problem (Q490211) (← links)
• Robust UAV mission planning (Q490224) (← links)
• Preprocessing for a map sectorization problem by means of mathematical programming (Q490244) (← links)
• The Steiner tree problem with delays: a compact formulation and reduction procedures (Q496653) (← links)
• The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663) (← links)
• On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches (Q512864) (← links)
• Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
• An interactive approach for biobjective integer programs under quasiconvex preference functions (Q512966) (← links)
• Minisum and maximin aerial surveillance over disjoint rectangles (Q518456) (← links)
• A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times (Q552221) (← links)
• A single machine scheduling problem with availability constraints and sequence-dependent setup costs (Q552454) (← links)