IDEAS home Printed from https://ideas.repec.org/r/eee/ejores/v101y1997i1p220-223.html
   My bibliography  Save this item

A note on a global approach for general 0-1 fractional programming

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Bechler, Georg & Steinhardt, Claudius & Mackert, Jochen & Klein, Robert, 2021. "Product line optimization in the presence of preferences for compromise alternatives," European Journal of Operational Research, Elsevier, vol. 288(3), pages 902-917.
  2. Chang, Ching-Ter, 2002. "On the posynomial fractional programming problems," European Journal of Operational Research, Elsevier, vol. 143(1), pages 42-52, November.
  3. Tien Mai & Arunesh Sinha, 2022. "Safe Delivery of Critical Services in Areas with Volatile Security Situation via a Stackelberg Game Approach," Papers 2204.11451, arXiv.org.
  4. Andrew Trapp & Oleg A. Prokopyev & Stanislav Busygin, 2010. "Finding checkerboard patterns via fractional 0–1 programming," Journal of Combinatorial Optimization, Springer, vol. 20(1), pages 1-26, July.
  5. Martin, Florian & Hemmelmayr, Vera C. & Wakolbinger, Tina, 2021. "Integrated express shipment service network design with customer choice and endogenous delivery time restrictions," European Journal of Operational Research, Elsevier, vol. 294(2), pages 590-603.
  6. Veremyev, Alexander & Boginski, Vladimir, 2012. "Identifying large robust network clusters via new compact formulations of maximum k-club problems," European Journal of Operational Research, Elsevier, vol. 218(2), pages 316-326.
  7. Billionnet, Alain, 2004. "Mixed integer programming for the 0-1 maximum probability model," European Journal of Operational Research, Elsevier, vol. 156(1), pages 83-91, July.
  8. Shuyu Zhou & Yeming (Yale) Gong & René de Koster, 2016. "Designing self-storage warehouses with customer choice," International Journal of Production Research, Taylor & Francis Journals, vol. 54(10), pages 3080-3104, May.
  9. Georg Bechler & Claudius Steinhardt & Jochen Mackert, 2021. "On the Linear Integration of Attraction Choice Models in Business Optimization Problems," SN Operations Research Forum, Springer, vol. 2(1), pages 1-13, March.
  10. Erfan Mehmanchi & Andrés Gómez & Oleg A. Prokopyev, 2019. "Fractional 0–1 programs: links between mixed-integer linear and conic quadratic formulations," Journal of Global Optimization, Springer, vol. 75(2), pages 273-339, October.
  11. Chang, Ching-Ter, 2001. "On the polynomial mixed 0-1 fractional programming problems," European Journal of Operational Research, Elsevier, vol. 131(1), pages 224-227, May.
  12. Mai, Tien & Lodi, Andrea, 2020. "A multicut outer-approximation approach for competitive facility location under random utilities," European Journal of Operational Research, Elsevier, vol. 284(3), pages 874-881.
  13. Cornelia Schön & Pratibha Saini, 2018. "Market-Oriented Service Network Design When Demand is Sensitive to Congestion," Transportation Science, INFORMS, vol. 52(5), pages 1253-1275, October.
  14. Wu, Tai-Hsi & Lin, Jen-Nan, 2003. "Solving the competitive discretionary service facility location problem," European Journal of Operational Research, Elsevier, vol. 144(2), pages 366-378, January.
  15. Prokopyev, Oleg A. & Kong, Nan & Martinez-Torres, Dayna L., 2009. "The equitable dispersion problem," European Journal of Operational Research, Elsevier, vol. 197(1), pages 59-67, August.
  16. Andrew C. Trapp & Wen Liu & Soussan Djamasbi, 2019. "Identifying Fixations in Gaze Data via Inner Density and Optimization," INFORMS Journal on Computing, INFORMS, vol. 31(3), pages 459-476, July.
  17. Mavrotas, G. & Diakoulaki, D. & Caloghirou, Y., 2006. "Project prioritization under policy restrictions. A combination of MCDA with 0-1 programming," European Journal of Operational Research, Elsevier, vol. 171(1), pages 296-308, May.
  18. Li, Yifu & Qi, Xiangtong, 2022. "A geometric branch-and-bound algorithm for the service bundle design problem," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1044-1056.
  19. Chang, Ching-Ter, 2006. "Formulating the mixed integer fractional posynomial programming," European Journal of Operational Research, Elsevier, vol. 173(2), pages 370-386, September.
  20. Samyukta Sethuraman & Sergiy Butenko, 2015. "The maximum ratio clique problem," Computational Management Science, Springer, vol. 12(1), pages 197-218, January.
  21. Jose Joaquin del Pozo-Antúnez & Francisco Fernández-Navarro & Horacio Molina-Sánchez & Antonio Ariza-Montes & Mariano Carbonero-Ruz, 2021. "The Machine-Part Cell Formation Problem with Non-Binary Values: A MILP Model and a Case of Study in the Accounting Profession," Mathematics, MDPI, vol. 9(15), pages 1-16, July.
  22. M. Hosein Zare & Juan S. Borrero & Bo Zeng & Oleg A. Prokopyev, 2019. "A note on linearized reformulations for a class of bilevel linear integer problems," Annals of Operations Research, Springer, vol. 272(1), pages 99-117, January.
  23. Strauss, Arne K. & Klein, Robert & Steinhardt, Claudius, 2018. "A review of choice-based revenue management: Theory and methods," European Journal of Operational Research, Elsevier, vol. 271(2), pages 375-387.
  24. Juan S. Borrero & Colin Gillen & Oleg A. Prokopyev, 2017. "Fractional 0–1 programming: applications and algorithms," Journal of Global Optimization, Springer, vol. 69(1), pages 255-282, September.
  25. Alexandre Belloni & Mitchell J. Lovett & William Boulding & Richard Staelin, 2012. "Optimal Admission and Scholarship Decisions: Choosing Customized Marketing Offers to Attract a Desirable Mix of Customers," Marketing Science, INFORMS, vol. 31(4), pages 621-636, July.
  26. König, Eva & Schön, Cornelia, 2021. "Railway delay management with passenger rerouting considering train capacity constraints," European Journal of Operational Research, Elsevier, vol. 288(2), pages 450-465.
  27. Juan José Miranda Bront & Isabel Méndez-Díaz & Gustavo Vulcano, 2009. "A Column Generation Algorithm for Choice-Based Network Revenue Management," Operations Research, INFORMS, vol. 57(3), pages 769-784, June.
  28. Erdogan, Günes & Cordeau, Jean-François & Laporte, Gilbert, 2010. "The Attractive Traveling Salesman Problem," European Journal of Operational Research, Elsevier, vol. 203(1), pages 59-69, May.
  29. Stanislav Busygin & Oleg A. Prokopyev & Panos M. Pardalos, 2005. "Feature Selection for Consistent Biclustering via Fractional 0–1 Programming," Journal of Combinatorial Optimization, Springer, vol. 10(1), pages 7-21, August.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.