The Benders method and parametrization of the right-hand sides in the mixed integer linear programming problem
The block plan problem. A graphtheoretic approach
The complexity of the travelling repairman problem
The Reliability of Systems With Stair-Type Consecutive Minimal Cuts
The set covering problem : a group theoretic approach
Tractable algorithms for chance-constrained combinatorial problems
This paper aims at proposing tractable algorithms to find effectively good solutions to large size chance-constrained combinatorial problems. A new robust model is introduced to deal with uncertainty in mixed-integer linear problems. It is shown to be strongly related to chance-constrained programming when considering pure 0–1 problems. Furthermore, its tractability is highlighted. Then, an optimization algorithm is designed to provide possibly good solutions to chance-constrained combinatorial...
Two algorithms for integer optimization
Two Machine Scheduling Problem when Passing Allowed.