The following pages link to Aristide Mingozzi (Q233545):
Displaying 45 items.
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (Q439444) (← links)
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965) (← links)
- A dual ascent procedure for the set partitioning problem (Q955334) (← links)
- An exact solution framework for a broad class of vehicle routing problems (Q993700) (← links)
- (Q1142699) (redirect page) (← links)
- Contributions to the quadratic assignment problem (Q1142700) (← links)
- A heuristic procedure for the crew rostering problem (Q1194743) (← links)
- A bionomic approach to the capacitated \(p\)-median problem (Q1273663) (← links)
- The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case (Q1429289) (← links)
- The two-dimensional finite bin packing problem. II: New lower and upper bounds (Q1432017) (← links)
- An exact algorithm for the simplified multiple depot crew scheduling problem (Q1888181) (← links)
- Partitioning a matrix to minimize the maximum cost (Q1900148) (← links)
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations (Q1908292) (← links)
- The project scheduling problem with irregular starting time costs (Q1969764) (← links)
- Algorithms for the non-bifurcated network design problem (Q2271128) (← links)
- A unified exact method for solving different classes of vehicle routing problems (Q2390996) (← links)
- The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem (Q2489310) (← links)
- An Exact Method for the Vehicle Routing Problem with Backhauls (Q2783863) (← links)
- An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation (Q2783969) (← links)
- New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows (Q2815450) (← links)
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem (Q2879522) (← links)
- An Exact Method for the Capacitated Location-Routing Problem (Q2879523) (← links)
- An Exact Algorithm for the Period Routing Problem (Q3013932) (← links)
- (Q3048582) (← links)
- (Q3048611) (← links)
- An Exact Algorithm for the Pickup and Delivery Problem with Time Windows (Q3098764) (← links)
- (Q3489779) (← links)
- An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation (Q3637437) (← links)
- Dynamic Loading and Unloading of Liquids into Tanks (Q3887189) (← links)
- State-space relaxation procedures for the computation of bounds to routing problems (Q3908783) (← links)
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations (Q3911683) (← links)
- (Q4016659) (← links)
- Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming (Q4294336) (← links)
- Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints (Q4367231) (← links)
- An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections (Q4422622) (← links)
- A Set Partitioning Approach to the Crew Scheduling Problem (Q4545655) (← links)
- The traveling salesman problem with pickup, delivery, and ride-time constraints (Q4642421) (← links)
- (Q4737577) (← links)
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem (Q4814179) (← links)
- (Q4889095) (← links)
- The traveling salesman problem with cumulative costs (Q5287441) (← links)
- An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem (Q5301128) (← links)
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation (Q5321991) (← links)
- Partitioning a matrix with non-guillotine cuts to minimize the maximum cost (Q5957361) (← links)
- A new method for solving capacitated location problems based on a set partitioning approach (Q5959081) (← links)
