A decade of combinatorial optimization
Author
Abstract
Suggested Citation
DOI: 10.26481/umamet.1997023
Download full text from publisher
References listed on IDEAS
- K. Aardal & C. P. M. van Hoesel, 1996. "Polyhedral techniques in combinatorial optimization I: Theory," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 50(1), pages 3-26, March.
- László Lovász & Herbert E. Scarf, 1992.
"The Generalized Basis Reduction Algorithm,"
Mathematics of Operations Research, INFORMS, vol. 17(3), pages 751-764, August.
- Herbert E. Scarf & Laszlo Lovasz, 1990. "The Generalized Basis Reduction Algorithm," Cowles Foundation Discussion Papers 946, Cowles Foundation for Research in Economics, Yale University.
- Alexander I. Barvinok, 1994. "A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed," Mathematics of Operations Research, INFORMS, vol. 19(4), pages 769-779, November.
- Joseph Adams & Egon Balas & Daniel Zawack, 1988. "The Shifting Bottleneck Procedure for Job Shop Scheduling," Management Science, INFORMS, vol. 34(3), pages 391-401, March.
- Rekha R. Thomas, 1995. "A Geometric Buchberger Algorithm for Integer Programming," Mathematics of Operations Research, INFORMS, vol. 20(4), pages 864-884, November.
- Eugeniusz Nowicki & Czeslaw Smutnicki, 1996. "A Fast Taboo Search Algorithm for the Job Shop Problem," Management Science, INFORMS, vol. 42(6), pages 797-813, June.
- Aardal, K. & van Hoesel, C.P.M., 1995. "Polyhedral techniques in combinatorial optimization," Research Memorandum 014, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- William Cook & Thomas Rutherford & Herbert E. Scarf & David Shallcross, 1993.
"An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming,"
INFORMS Journal on Computing, INFORMS, vol. 5(2), pages 206-212, May.
- William Cook & Thomas Rutherford & Herbert E. Scarf & David F. Shallcross, 1991. "An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming," Cowles Foundation Discussion Papers 990, Cowles Foundation for Research in Economics, Yale University.
- SCHULTZ, Rüdiger & STOUGIE, Leen & van der VLERK, Maarten, 1995. "Solving Stochastic Programs with Complete Integer Recourse : A Framework Using Gröbner Bases," LIDAM Discussion Papers CORE 1995062, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Wansoo T. Rhee & Michel Talagrand, 1989. "Martingale Inequalities, Interpolation and NP-Complete Problems," Mathematics of Operations Research, INFORMS, vol. 14(1), pages 91-96, February.
- Aardal, K.I. & van Hoesel, S., 1995. "Polyhedral Techniques in Combinatorial Optimization," Other publications TiSEM ed028a07-eb6a-4c8d-8f21-d, Tilburg University, School of Economics and Management.
- Awi Federgruen & Michal Tzur, 1991. "A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time," Management Science, INFORMS, vol. 37(8), pages 909-925, August.
- Aardal, K.I. & van Hoesel, S., 1995. "Polyhedral Techniques in Combinatorial Optimization," Discussion Paper 1995-57, Tilburg University, Center for Economic Research.
- Alok Aggarwal & James K. Park, 1993. "Improved Algorithms for Economic Lot Size Problems," Operations Research, INFORMS, vol. 41(3), pages 549-571, June.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Aardal Karen, 1997. "A decade of combinatorial optimization," Research Memorandum 044, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- Karen Aardal & Cor A. J. Hurkens & Arjen K. Lenstra, 2000. "Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables," Mathematics of Operations Research, INFORMS, vol. 25(3), pages 427-442, August.
- Gérard Cornuéjols & Milind Dawande, 1999. "A Class of Hard Small 0-1 Programs," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 205-210, May.
- Karen Aardal & Arjen K. Lenstra, 2004. "Hard Equality Constrained Integer Knapsacks," Mathematics of Operations Research, INFORMS, vol. 29(3), pages 724-738, August.
- Aardal, K.I. & van Hoesel, S., 1995. "Polyhedral Techniques in Combinatorial Optimization," Other publications TiSEM ed028a07-eb6a-4c8d-8f21-d, Tilburg University, School of Economics and Management.
- Karen Aardal & Frederik von Heymann, 2014. "On the Structure of Reduced Kernel Lattice Bases," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 823-840, August.
- A Lim & Z Xu & F Wang, 2008. "The bidding selection and assignment problem with minimum quantity commitment," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(5), pages 693-702, May.
- Wolosewicz, Cathy & Dauzère-Pérès, Stéphane & Aggoune, Riad, 2015. "A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 3-12.
- Stan van Hoesel & H. Edwin Romeijn & Dolores Romero Morales & Albert P. M. Wagelmans, 2005. "Integrated Lot Sizing in Serial Supply Chains with Production Capacities," Management Science, INFORMS, vol. 51(11), pages 1706-1719, November.
- Hark‐Chin Hwang & Wilco van den Heuvel, 2012.
"Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging,"
Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(3‐4), pages 244-253, April.
- Hwang, H.C. & van den Heuvel, W., 2010. "Improved Algorithms for a Lot-Sizing Problem with Inventory Bounds and Backlogging," Econometric Institute Research Papers EI 2010-17, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
- Martel, Alain & Gascon, Andre, 1998. "Dynamic lot-sizing with price changes and price-dependent holding costs," European Journal of Operational Research, Elsevier, vol. 111(1), pages 114-128, November.
- Liaw, Ching-Fang, 2000. "A hybrid genetic algorithm for the open shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 124(1), pages 28-42, July.
- Herbert Meyr & Mirko Kiel, 2022. "Minimizing setups and waste when printing labels of consumer goods," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(3), pages 733-761, September.
- Nadjib Brahimi & Stéphane Dauzère-Pérès & Najib M. Najid, 2006. "Capacitated Multi-Item Lot-Sizing Problems with Time Windows," Operations Research, INFORMS, vol. 54(5), pages 951-967, October.
- Rego, César & Duarte, Renato, 2009. "A filter-and-fan approach to the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 194(3), pages 650-662, May.
- Bürgy, Reinhard & Bülbül, Kerem, 2018. "The job shop scheduling problem with convex costs," European Journal of Operational Research, Elsevier, vol. 268(1), pages 82-100.
- Piñeyro, Pedro & Viera, Omar, 2010. "The economic lot-sizing problem with remanufacturing and one-way substitution," International Journal of Production Economics, Elsevier, vol. 124(2), pages 482-488, April.
- Hark-Chin Hwang, 2010. "Economic Lot-Sizing for Integrated Production and Transportation," Operations Research, INFORMS, vol. 58(2), pages 428-444, April.
- Chung-Lun Li & Qingying Li, 2016. "Polynomial-Time Solvability of Dynamic Lot Size Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(03), pages 1-20, June.
- Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:unm:umamet:1997023. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Andrea Willems or Leonne Portz (email available below). General contact details of provider: https://edirc.repec.org/data/meteonl.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.