S3 sets. An extension of the Beale-Tomlin special ordered sets
From MaRDI portal
(Redirected from Publication:1102852)
Recommendations
Cites work
- scientific article; zbMATH DE number 3908160 (Why is no real title available?)
- scientific article; zbMATH DE number 3757695 (Why is no real title available?)
- Computer Codes for Problems of Integer Programming
- Global optimization using special ordered sets
- 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
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
Cited in
(10)- 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
- 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
- On a fix-and-relax framework for a class of project scheduling problems
- A framework for tightening 0-1 programs based on extensions of pure 0-1 KP and SS problems
- On a stochastic sequencing and scheduling problem
- Generating cuts in integer programming with families of special ordered sets
- Implementations of special ordered sets in MP software
- Two alternative models for farm management: Discrete versus continuous time horizon
This page was built for publication: S3 sets. An extension of the Beale-Tomlin special ordered sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102852)