Logic applied to integer programming and integer programming applied to logic
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Mitra, G. & Lucas, C. & Moody, S. & Hadjiconstantinou, E., 1994. "Tools for reformulating logical forms into zero-one mixed integer programs," European Journal of Operational Research, Elsevier, vol. 72(2), pages 262-276, January.
- Hooker, N.J., 1991. "Solving the Incremental Satisfiability Problem," GSIA Working Papers 1991-9, Carnegie Mellon University, Tepper School of Business.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Azibi, R. & Vanderpooten, D., 2002. "Construction of rule-based assignment models," European Journal of Operational Research, Elsevier, vol. 138(2), pages 274-293, April.
- John N. Hooker, 2002. "Logic, Optimization, and Constraint Programming," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 295-321, November.
- Wai Kin (Victor) Chan & Lee Schruben, 2008. "Optimization Models of Discrete-Event System Dynamics," Operations Research, INFORMS, vol. 56(5), pages 1218-1237, October.
- Yannis Pavlis & Will Recker, 2009. "A Mathematical Logic Approach for the Transformation of the Linear Conditional Piecewise Functions of Dispersion-and-Store and Cell Transmission Traffic Flow Models into Linear Mixed-Integer Form," Transportation Science, INFORMS, vol. 43(1), pages 98-116, February.
- S. Bollapragada & O. Ghattas & J. N. Hooker, 2001. "Optimal Design of Truss Structures by Logic-Based Branch and Cut," Operations Research, INFORMS, vol. 49(1), pages 42-51, February.
- H. Paul Williams & John M. Wilson, 1998. "Connections Between Integer Linear Programming and Constraint Logic Programming—An Overview and Introduction to the Cluster of Articles," INFORMS Journal on Computing, INFORMS, vol. 10(3), pages 261-264, August.
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.- Plastria, Frank, 2002. "Formulating logical implications in combinatorial optimisation," European Journal of Operational Research, Elsevier, vol. 140(2), pages 338-353, July.
- Mavrotas, G. & Diakoulaki, D., 1998. "A branch and bound algorithm for mixed zero-one multiple objective linear programming," European Journal of Operational Research, Elsevier, vol. 107(3), pages 530-541, June.
- L. Foulds & B. Toklu & J. Wilson, 2009. "Modelling either-or relations in integer programming," Annals of Operations Research, Springer, vol. 166(1), pages 203-222, February.
- Azibi, R. & Vanderpooten, D., 2002. "Construction of rule-based assignment models," European Journal of Operational Research, Elsevier, vol. 138(2), pages 274-293, April.
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:eee:ejores:v:81:y:1995:i:3:p:605-616. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.