Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Carlo Mannino
Information about the author Carlo Mannino will soon be added to the site.
Found
12 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
An Exact Decomposition Approach for the Real-Time Train Dispatching Problem
2015
Trains’ movements on a railway network are regulated by official timetables....
Optimal Train Dispatching by Benders’-Like Reformulation
2016
Train movements on railway lines are generally controlled by human dispatchers....
Modelling and solving generalised operational surgery scheduling problems
2016
The term 'surgery scheduling' is used to describe a variety of strategic, tactical and...
GUB Covers and Power‐Indexed Formulations for Wireless Network Design
2013
We propose a pure 0‐1 formulation for the wireless network design problem,...
The implementor/adversary algorithm for the cyclic and robust scheduling problem in health‐care
2013
A general problem in health‐care consists in allocating some scarce medical...
A pattern based, robust approach to cyclic master surgery scheduling
2012
The Master Surgery Scheduling problem consists of finding a suitable allocation of...
Optimal real-time traffic control in Metro stations
2009
Train movements across railway stations are still operated by human dispatchers....
Models and solution techniques for frequency assignment problems
2007
Wireless communication is used in many different situations such as mobile telephony,...
The network packing problem in terrestrial broadcasting
2006
The introduction of digital terrestrial broadcasting all over Europe requires a...
The stable set problem and the thinness of a graph
2007
We introduce a poly-time algorithm for the maximum weighted stable set problem, when a...
An augmentation algorithm for the maximum weighted stable set problem
1999
Edge projection is a specialization of Lovász and Plummer's clique reduction...
Solving hard set covering problems
1995
The authors propose a new branch-and-bound algorithm to solve hard instances of set...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers