S3 sets. An extension of the Beale-Tomlin special ordered sets

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)

zbMATH Keywords

special ordered sets; additional exclusivity constraints; precedence relationsships

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90B30: Production models

90C09: Boolean programming

Related Items

On a fix-and-relax framework for a class of project scheduling problems, On a stochastic sequencing and scheduling problem, 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, A global optimization point of view to handle non-standard object packing 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