The following pages link to Carlo Mannino (Q234005):
Displaying 31 items.
- Modelling and solving generalised operational surgery scheduling problems (Q342152) (← links)
- (Q538304) (redirect page) (← links)
- Planning wireless networks by shortest path (Q538307) (← links)
- Upward drawings of triconnected digraphs. (Q960528) (← links)
- On the cubicity of certain graphs (Q1041732) (← links)
- An exact algorithm for the maximum stable set problem (Q1328431) (← links)
- An enumerative algorithm for the frequency assignment problem (Q1399116) (← links)
- Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling (Q1751262) (← links)
- An augmentation algorithm for the maximum weighted stable set problem (Q1819158) (← links)
- Solving hard set covering problems (Q1924619) (← links)
- Air traffic flow management with layered workload constraints (Q2027028) (← links)
- The implementor/adversary algorithm for the cyclic and robust scheduling problem in health-care (Q2253602) (← links)
- Time offset optimization in digital broadcasting (Q2473033) (← links)
- The stable set problem and the thinness of a graph (Q2643810) (← links)
- The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming (Q2811317) (← links)
- Negative Cycle Separation in Wireless Network Design (Q3091482) (← links)
- Optimal Real-Time Traffic Control in Metro Stations (Q3100405) (← links)
- An Exact Decomposition Approach for the Real-Time Train Dispatching Problem (Q3195230) (← links)
- The Network Packing Problem in Terrestrial Broadcasting (Q3392007) (← links)
- Optimal Upward Planarity Testing of Single-Source Digraphs (Q4388867) (← links)
- Computing Optimal Recovery Policies for Financial Markets (Q4909109) (← links)
- Easy Cases of Deadlock Detection in Train Scheduling (Q5106357) (← links)
- A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management (Q5129213) (← links)
- (Q5294077) (← links)
- (Q5687256) (← links)
- Models and solution techniques for frequency assignment problems (Q5907051) (← links)
- Models and solution techniques for frequency assignment problems (Q5920489) (← links)
- Minimizing the span \(d\)-walks to compute optimum frequency assignments. (Q5957570) (← links)
- An optimization-based decision support tool for incremental train timetabling (Q6081829) (← links)
- A MaxSAT approach for solving a new dynamic discretization discovery model for train rescheduling problems (Q6568503) (← links)
- The path\&cycle formulation for the hotspot problem in air traffic management (Q6594076) (← links)
