Mixed-Integer Linear Program for the Operational Harvest Scheduling Problem: An Application to the Thai Sugar Industry
Abstract
References
Index Terms
- Mixed-Integer Linear Program for the Operational Harvest Scheduling Problem: An Application to the Thai Sugar Industry
Recommendations
Extending the QCR method to general mixed-integer programs
Let (MQP) be a general mixed integer quadratic program that consists of minimizing a quadratic function subject to linear constraints. In this paper, we present a convex reformulation of (MQP), i.e. we reformulate (MQP) into an equivalent program, with ...
Safe bounds in linear and mixed-integer linear programming
Current mixed-integer linear programming solvers are based on linear programming routines that use floating-point arithmetic. Occasionally, this leads to wrong solutions, even for problems where all coefficients and all solution components are small ...
Valid Linear Programming Bounds for Exact Mixed-Integer Programming
Fast computation of valid linear programming LP bounds serves as an important subroutine for solving mixed-integer programming problems exactly. We introduce a new method for computing valid LP bounds designed for this application. The algorithm ...
Comments
Information & Contributors
Information
Published In

In-Cooperation
- Southwest Jiaotong University
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 55Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in