S3 sets. An extension of the Beale-Tomlin special ordered sets
From MaRDI portal
Publication:1102852
DOI10.1007/BF01589396zbMath0644.90049MaRDI QIDQ1102852
Laureano Fernando Escudero Bueno
Publication date: 1988
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Production models (90B30) Boolean programming (90C09)
Related Items
On a stochastic sequencing and scheduling problem, A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems, A global optimization point of view to handle non-standard object packing problems, Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds, Generating cuts in integer programming with families of special ordered sets, Efficient reformulation for 0-1 programs -- methods and computational results, \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates, Two alternative models for farm management: Discrete versus continuous time horizon, On a fix-and-relax framework for a class of project scheduling problems
Cites Work
- Unnamed Item
- Unnamed Item
- On maintenance scheduling of production units
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- Solving Large-Scale Zero-One Linear Programming Problems
- Computer Codes for Problems of Integer Programming
- Global optimization using special ordered sets
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
