Valid inequalities for the Time-Indexed Non-Preemptive Single Machine Scheduling Problem

@article{ankit2026,
  title        = {{Valid inequalities for the Time-Indexed Non-Preemptive Single Machine Scheduling Problem}},
  author       = {Ankit Bansal},
  journal      = {Discrete Optimization},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.1016/j.disopt.2025.100926},
}

TY  - JOUR
TI  - Valid inequalities for the Time-Indexed Non-Preemptive Single Machine Scheduling Problem
AU  - Bansal, Ankit
JO  - Discrete Optimization
PY  - 2026
ER  -

Ankit Bansal (2026). Valid inequalities for the Time-Indexed Non-Preemptive Single Machine Scheduling Problem. *Discrete Optimization*. https://doi.org/https://doi.org/10.1016/j.disopt.2025.100926

Ankit Bansal. "Valid inequalities for the Time-Indexed Non-Preemptive Single Machine Scheduling Problem." *Discrete Optimization* (2026). https://doi.org/https://doi.org/10.1016/j.disopt.2025.100926.

Valid inequalities for the Time-Indexed Non-Preemptive Single Machine Scheduling Problem
Ankit Bansal · Discrete Optimization · 2026
https://doi.org/https://doi.org/10.1016/j.disopt.2025.100926