Case Article—Pediatrician Scheduling at British Columbia Women’s Hospital
Abstract
References
Recommendations
A branch and price algorithm for single-machine completion time variance
Highlights- The single-machine completion time variance problem 1||CTV is studied from the viewpoint of exact solutions.
AbstractThis paper studies a single machine scheduling problem to minimize the completion time variance (CTV) of all jobs. A new time-indexed quadratic programming formulation is proposed, in which the quadratic terms are further linearized ...
Technical Note—There’s No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization
There's No Free Lunch in Bilevel Optimization
Linear bilevel problems are often reformulated as single-level problems by using the KKT optimality conditions of the lower level. The resulting KKT complementarity conditions are usually linearized by the classical big-M approach. However, this approach ...
One of the most frequently used approaches to solve linear bilevel optimization problems consists in replacing the lower-level problem with its Karush–Kuhn–Tucker (KKT) conditions and by reformulating the KKT complementarity conditions using techniques ...
Comments
Information & Contributors
Information
Published In
Publisher
INFORMS
Linthicum, MD, United States
Publication History
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0