Name
Abstract | ||
|---|---|---|
This paper defines a set of material compatibility constraints for use in order promising mixed integer programs. The constraints always represent a necessary condition for compatibility and, in certain cases, are both necessary and sufficient. The underlying analysis represents incompatibilities using bipartite graphs and applies results from the perfectly matchable subgraph polytope. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0167-6377(03)00045-2 | Oper. Res. Lett. |
Keywords | Field | DocType |
certain case,mixed integer program,bipartite graph,production planning,matchable subgraph polytope,material compatibility constraint,underlying analysis,necessary condition,make-to-order production planning,matching,integer programming,make to order | Integer,Discrete mathematics,Mathematical optimization,Combinatorics,Compatibility (mechanics),Bipartite graph,Build to order,Polytope,Integer programming,Production planning,Mathematics | Journal |
Volume | Issue | ISSN |
31 | 6 | Operations Research Letters |
Citations | PageRank | References |
5 | 1.23 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael O. Ball | 1 | 939 | 146.10 |
| Chien-Yu Chen | 2 | 367 | 29.24 |
| Zhen-Ying Zhao | 3 | 45 | 6.07 |