The following pages link to Gianpaolo Ghiani (Q337091):
Displaying 50 items.
- A lower bound for the quickest path problem (Q337093) (← links)
- Model-based automatic neighborhood design by unsupervised learning (Q337347) (← links)
- Time-dependent routing problems: a review (Q342083) (← links)
- Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions (Q702760) (← links)
- Improved formulation, branch-and-cut and tabu search heuristic for single loop material flow system design (Q857364) (← links)
- Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions (Q964850) (← links)
- A multi-modal approach to the location of a rapid transit line (Q1291658) (← links)
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. (Q1406947) (← links)
- Solving the hierarchical Chinese postman problem as a rural postman problem. (Q1428044) (← links)
- A branch-and-cut algorithm for the undirected rural postman problem (Q1575070) (← links)
- A branch-and-bound algorithm for the time-dependent rural postman problem (Q1628130) (← links)
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration (Q1652297) (← links)
- A heuristic for the periodic rural postman problem (Q1885936) (← links)
- The capacitated plant location problem with multiple facilities in the same site (Q1941959) (← links)
- An algorithm for the hierarchical Chinese postman problem (Q1970425) (← links)
- An efficient transformation of the generalized vehicle routing problem (Q1971986) (← links)
- An enhanced lower bound for the time-dependent travelling salesman problem (Q2333147) (← links)
- Integrated shipment dispatching and packing problems: a case study (Q2369964) (← links)
- Single-machine time-dependent scheduling problems with fixed rate-modifying activities and resumable jobs (Q2399611) (← links)
- Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm (Q2414451) (← links)
- A combined procedure for discrete simulation-optimization problems based on the simulated annealing framework (Q2457953) (← links)
- Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs (Q2483511) (← links)
- A constructive heuristic for the undirected rural postman problem (Q2496045) (← links)
- Fix and relax heuristic for a stochastic lot-sizing problem (Q2506172) (← links)
- On path ranking in time-dependent graphs (Q2669544) (← links)
- The multi-period \(p\)-center problem with time-dependent travel times (Q2669591) (← links)
- A scalable anticipatory policy for the dynamic pickup and delivery problem (Q2676347) (← links)
- The capacitated arc routing problem with intermediate facilities (Q2719845) (← links)
- (Q2865874) (← links)
- Approximation neighborhood evaluation for the design of the logistics support of complex engineering systems (Q2969954) (← links)
- Batch scheduling in a two-stage flow shop with parallel and bottleneck machines (Q3021820) (← links)
- Allocating production batches to subcontractors by fuzzy goal programming (Q3044041) (← links)
- Solving the Job Sequencing and Tool Switching Problem as a nonlinear least cost Hamiltonian cycle problem (Q3057161) (← links)
- The Black and White Traveling Salesman Problem (Q3391982) (← links)
- The lane covering problem with time windows (Q3512195) (← links)
- EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM (Q3580197) (← links)
- A Lagrangean heuristic for the plant location problem with multiple facilities in the same site (Q4405938) (← links)
- The Arc Routing and Scheduling Problem with Transshipment (Q4408700) (← links)
- The time-dependent quickest path problem: Properties and bounds (Q4642443) (← links)
- The laser-plotter beam routing problem (Q4658482) (← links)
- (Q4668751) (← links)
- Eulerian location problems (Q4934874) (← links)
- (Q4999375) (← links)
- (Q5271452) (← links)
- (Q5271463) (← links)
- New policies for the dynamic traveling salesman problem (Q5426977) (← links)
- Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem (Q5463668) (← links)
- A taboo search heuristic for the optimisation of a multistage component placement system (Q5718001) (← links)
- Comments on: ``Perspectives on integer programming for time-dependent models'' (Q5970688) (← links)
- A learn‐and‐construct framework for general mixed‐integer programming problems (Q6066679) (← links)
