The classical maximum flow problem sometimes occurs in settings in which the arc capacities are not fixed but are functions of a single parameter, and the goal is to find the value of the parameterâ€¦ (More)

We deal with directed hypergraphs as a tool to model and solve some classes of problems arising in Operations Research and in Computer Science. Concepts such as connectivity, paths and cuts areâ€¦ (More)

The problem of finding a work assignment for airline crew members in a given time horizon is addressed. In the literature this problem is usually referred to as the airline crew rostering problem. Itâ€¦ (More)

D The best-known algorithm for the satisfiability problem in the case of propositional formulae (SAT) is the implicit enumeration version of the Davis-Putnam algorithm, as described in Loveland'sâ€¦ (More)

We address the well-known satisfiability problem (SAT). i.e., the problem of checking whether a given propositional formula is satisfiable. Although the general satisfiability problem is NP-complete,â€¦ (More)

The problem of simultaneously locating obnoxious facilities and routing obnoxious materials between a set of built-up areas and the facilities is addressed. Obnoxious facilities are those facilitiesâ€¦ (More)

We present a Cost Decomposition approach for the linear Multicommodity Min-Cost Flow problem, where the mutual capacity constraints are dualized and the resulting Lagrangean Dual is solved with aâ€¦ (More)