We give an alternative proof to a characterization theorem of Gurvich for Boolean functions whose formula size is exactly the number of variables. Those functions are called Read-Once. We use methods of combinatorial optimization and give as a corollary an alternative proof for some results of Seymour.

Production-inventory games were introduced in [Guardiola, L.A., Meca, A., Puerto, J. (2008). Production-Inventory games: A new class of totally balanced combinatorial optimization games. Games Econom. Behav. doi:10.1016/j.geb.2007.02.003] as a new class of totally balanced combinatorial optimization games. From among all core-allocations, the Owen point was proposed as a specifically appealing ...

Local Constraints in Combinatorial Optimization

Nowadays, there is much attention for planning of container terminals in the global trade centers. The high cost of quay cranes motivates both scholars and industrial practitioners especially in the last decade to develop novel optimization models to address this dilemma. This study proposes a coordinated optimization model to cover both Quay Crane Scheduling Problem (QCSP) and Quay Crane Assig...