Pages that link to "Item:Q4661044"

The following pages link to A branch-and-cut algorithm for the plant-cycle location problem (Q4661044):

Displaying 13 items.

• The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm (Q320620) (← links)
• Rapid transit network design for optimal cost and origin-destination demand capture (Q336685) (← links)
• A branch-and-cut algorithm for the hub location and routing problem (Q337094) (← links)
• A branch-and-cut algorithm for two-level survivable network design problems (Q342262) (← links)
• Multi-depot multiple TSP: a polyhedral study and computational results (Q367624) (← links)
• A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery (Q713116) (← links)
• Location-routing: issues, models and methods (Q856260) (← links)
• The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach (Q1651527) (← links)
• Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network (Q1991177) (← links)
• Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem (Q2815453) (← links)
• A taxonomical analysis, current methods and objectives on location-routing problems (Q2865162) (← links)
• Cost-effective designs of fault-tolerant access networks in communication systems (Q3057095) (← links)
• A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem (Q6065616) (← links)