The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
It was proved few years ago that classes of Boolean functions definable by means of functional equations [9], or equivalently, by means of relational constraints [16], coincide wit...
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
Marjan van den Akker, Cor A. J. Hurkens, Martin W....
This paper concentrates on characterizing energy, latency and capacity trade-offs in multi-hop wireless ad-hoc networks. Therefore, a multiobjective framework is proposed to derive...
Jean-Marie Gorce, Ruifeng Zhang, Katia Jaffr&egrav...
This paper presents an approach for combined mass and energy integration in process synthesis and illustrates it at the thermochemical production of crude synthetic natural gas (S...