The following pages link to Emanuela Guerriero (Q337092):
Displaying 21 items.
- A lower bound for the quickest path problem (Q337093) (← links)
- Time-dependent routing problems: a review (Q342083) (← links)
- Robust scheduling of parallel machines with sequence-dependent set-up costs (Q706962) (← 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)
- An enhanced lower bound for the time-dependent travelling salesman problem (Q2333147) (← 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)
- Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs (Q2483511) (← 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)
- 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)
- Scheduling in dial-indexed production lines (Q4474678) (← links)
- The time-dependent quickest path problem: Properties and bounds (Q4642443) (← 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)
- Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems (Q6069740) (← links)
- A multimodal tourist trip planner integrating road and pedestrian networks (Q6403689) (← links)
- Recovering feasibility in real-time conflict-free vehicle routing (Q6411374) (← links)
