Automated knowledge source selection and service composition
Author
Abstract
Suggested Citation
DOI: 10.1007/s10589-011-9423-1
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
- Atamturk, Alper & Nemhauser, George L. & Savelsbergh, Martin W. P., 2000. "Conflict graphs in solving integer programming problems," European Journal of Operational Research, Elsevier, vol. 121(1), pages 40-55, February.
- M. W. P. Savelsbergh, 1994. "Preprocessing and Probing Techniques for Mixed Integer Programming Problems," INFORMS Journal on Computing, INFORMS, vol. 6(4), pages 445-454, November.
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.- Wei-Kun Chen & Liang Chen & Mu-Ming Yang & Yu-Hong Dai, 2018. "Generalized coefficient strengthening cuts for mixed integer programming," Journal of Global Optimization, Springer, vol. 70(1), pages 289-306, January.
- Perraudat, Antoine & Dauzère-Pérès, Stéphane & Vialletelle, Philippe, 2022. "Robust tactical qualification decisions in flexible manufacturing systems," Omega, Elsevier, vol. 106(C).
- Boland, Natashia & Charkhgard, Hadi & Savelsbergh, Martin, 2019. "Preprocessing and cut generation techniques for multi-objective binary programming," European Journal of Operational Research, Elsevier, vol. 274(3), pages 858-875.
- Escudero, L. F. & Munoz, S., 2003. "On identifying dominant cliques," European Journal of Operational Research, Elsevier, vol. 149(1), pages 65-76, August.
- Nicolas Dupin, 2017. "Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(1), pages 149-176, March.
- Jeff T. Linderoth & Eva K. Lee & Martin W. P. Savelsbergh, 2001. "A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems," INFORMS Journal on Computing, INFORMS, vol. 13(3), pages 191-209, August.
- Tobias Achterberg & Robert E. Bixby & Zonghao Gu & Edward Rothberg & Dieter Weninger, 2020. "Presolve Reductions in Mixed Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 473-506, April.
- Santanu S. Dey & Jean-Philippe Richard, 2009. "Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 137-150, February.
- Avella, Pasquale & D'Auria, Bernardo & Salerno, Saverio, 2006. "A LP-based heuristic for a time-constrained routing problem," European Journal of Operational Research, Elsevier, vol. 173(1), pages 120-124, August.
- Zwaneveld, P. & Verweij, G. & van Hoesel, S., 2018. "Safe dike heights at minimal costs: An integer programming approach," European Journal of Operational Research, Elsevier, vol. 270(1), pages 294-301.
- Okan Arslan & Ola Jabali & Gilbert Laporte, 2020. "A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 120-134, January.
- S. Göttlich & A. Potschka & C. Teuber, 2019. "A partial outer convexification approach to control transmission lines," Computational Optimization and Applications, Springer, vol. 72(2), pages 431-456, March.
- Franco Peschiera & Robert Dell & Johannes Royset & Alain Haït & Nicolas Dupin & Olga Battaïa, 2021. "A novel solution approach with ML-based pseudo-cuts for the Flight and Maintenance Planning problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(3), pages 635-664, September.
- Jose L. Walteros & Austin Buchanan, 2020. "Why Is Maximum Clique Often Easy in Practice?," Operations Research, INFORMS, vol. 68(6), pages 1866-1895, November.
- Álvaro Porras & Concepción Domínguez & Juan Miguel Morales & Salvador Pineda, 2023. "Tight and Compact Sample Average Approximation for Joint Chance-Constrained Problems with Applications to Optimal Power Flow," INFORMS Journal on Computing, INFORMS, vol. 35(6), pages 1454-1469, November.
- Cappanera, Paola & Visintin, Filippo & Banditori, Carlo, 2014. "Comparing resource balancing criteria in master surgical scheduling: A combined optimisation-simulation approach," International Journal of Production Economics, Elsevier, vol. 158(C), pages 179-196.
- J. Paul Brooks & Eva K. Lee, 2014. "Solving a Multigroup Mixed-Integer Programming-Based Constrained Discrimination Model," INFORMS Journal on Computing, INFORMS, vol. 26(3), pages 567-585, August.
- Kaouthar Deghdak & Vincent T’kindt & Jean-Louis Bouquard, 2016. "Scheduling evacuation operations," Journal of Scheduling, Springer, vol. 19(4), pages 467-478, August.
- Lluís-Miquel Munguía & Geoffrey Oxberry & Deepak Rajan & Yuji Shinano, 2019. "Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs," Computational Optimization and Applications, Springer, vol. 73(2), pages 575-601, June.
More about this item
Keywords
Knowledge-based systems; Information integration; Knowledge source integration; Service composition; Integer programming;All these keywords.
Statistics
Access and download statisticsCorrections
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:spr:coopap:v:52:y:2012:i:2:p:507-535. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.