Dynamic Lagrangian dual and reduced RLT constructs for solving 0–1 mixed-integer programs
No abstract is available for this item.
Volume (Year): 20 (2012)
Issue (Month): 1 (April)
|Contact details of provider:|| Web page: http://www.springerlink.com/link.asp?id=120409|
|Order Information:||Web: http://link.springer.de/orders.htm|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Guignard, Monique, 1998. "Efficient cuts in Lagrangean `Relax-and-cut' schemes," European Journal of Operational Research, Elsevier, vol. 105(1), pages 216-223, February.
- Marshall L. Fisher, 1981. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 27(1), pages 1-18, January.
When requesting a correction, please mention this item's handle: RePEc:spr:topjnl:v:20:y:2012:i:1:p:173-189. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.