Pages that link to "Item:Q257227"

The following pages link to Compact formulations of the Steiner traveling salesman problem and related problems (Q257227):

Displaying 28 items.

• Optimal capacitated ring trees (Q286687) (← links)
• The Steiner traveling salesman problem with online edge blockages (Q319009) (← links)
• An algorithm for dynamic order-picking in warehouse operations (Q320634) (← links)
• A new mathematical programming formulation for the single-picker routing problem (Q323113) (← links)
• New formulations for the elementary shortest-path problem visiting a given set of nodes (Q323412) (← links)
• Pricing routines for vehicle routing with time windows on road networks (Q337163) (← links)
• Empirical analysis for the VRPTW with a multigraph representation for the road network (Q1651529) (← links)
• The Steiner traveling salesman problem with online advanced edge blockages (Q1651622) (← links)
• Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane (Q1651693) (← links)
• Optimally solving the joint order batching and picker routing problem (Q1683118) (← links)
• Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems (Q1694923) (← links)
• On the submodularity of multi-depot traveling salesman games (Q1727725) (← links)
• Exact algorithms for the order picking problem (Q1782167) (← links)
• The Steiner traveling salesman problem and its extensions (Q1999396) (← links)
• Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem (Q2027061) (← links)
• An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem (Q2059872) (← links)
• An extensible multi-block layout warehouse routing optimization model (Q2083945) (← links)
• The multiple Steiner TSP with order constraints: complexity and optimization algorithms (Q2156919) (← links)
• An efficient and general approach for the joint order batching and picker routing problem (Q2183853) (← links)
• Mixed integer formulations for a routing problem with information collection in wireless networks (Q2273919) (← links)
• Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs (Q2282284) (← links)
• Vehicle routing on road networks: how good is Euclidean approximation? (Q2668618) (← links)
• Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories (Q2835664) (← links)
• A note on computational aspects of the Steiner traveling salesman problem (Q6066594) (← links)
• A multi-visit flexible-docking vehicle routing problem with drones for simultaneous pickup and delivery services (Q6069219) (← links)
• Arc routing based compact formulations for picker routing in single and two block parallel aisle warehouses (Q6087542) (← links)
• The Steiner bi-objective shortest path problem (Q6114902) (← links)
• Improving a constructive heuristic for the general routing problem (Q6179705) (← links)