IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v176y2007i3p1404-1422.html
   My bibliography  Save this article

Multiple objective minimum cost flow problems: A review

Author

Listed:
  • Hamacher, Horst W.
  • Pedersen, Christian Roed
  • Ruzika, Stefan

Abstract

No abstract is available for this item.

Suggested Citation

  • Hamacher, Horst W. & Pedersen, Christian Roed & Ruzika, Stefan, 2007. "Multiple objective minimum cost flow problems: A review," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1404-1422, February.
    • Handle: RePEc:eee:ejores:v:176:y:2007:i:3:p:1404-1422
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00854-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. ,, 1998. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 14(5), pages 687-698, October.
    2. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(4), pages 691-705, August.
    3. Lee, Haijune & Simin Pulat, P., 1993. "Bicriteria network flow problems: Integer case," European Journal of Operational Research, Elsevier, vol. 66(1), pages 148-157, April.
    4. Y. P. Aneja & K. P. K. Nair, 1979. "Bicriteria Transportation Problem," Management Science, INFORMS, vol. 25(1), pages 73-78, January.
    5. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(1), pages 225-228, February.
    6. Current, John & Marsh, Michael, 1993. "Multiobjective transportation network design and routing problems: Taxonomy and annotation," European Journal of Operational Research, Elsevier, vol. 65(1), pages 4-19, February.
    7. ,, 1999. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 15(3), pages 427-432, June.
    8. D. Klingman & A. Napier & J. Stutz, 1974. "NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems," Management Science, INFORMS, vol. 20(5), pages 814-821, January.
    9. ,, 1999. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 15(4), pages 629-637, August.
    10. Fruhwirth, B. & Bukkard, R. E. & Rote, G., 1989. "Approximation of convex curves with application to the bicriterial minimum cost flow problem," European Journal of Operational Research, Elsevier, vol. 42(3), pages 326-338, October.
    11. Arthur M. Geoffrion, 1967. "Solving Bicriterion Mathematical Programs," Operations Research, INFORMS, vol. 15(1), pages 39-54, February.
    12. ,, 1999. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 15(5), pages 777-788, October.
    13. Minghe Sun, 2003. "Procedures for Finding Nondominated Solutions for Multiple Objective Network Programming Problems," Transportation Science, INFORMS, vol. 37(2), pages 139-152, May.
    14. ,, 1999. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 15(1), pages 151-160, February.
    15. Lee, Haijune & Simin Pulat, P., 1991. "Bicriteria network flow problems: Continuous case," European Journal of Operational Research, Elsevier, vol. 51(1), pages 119-126, March.
    16. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(5), pages 879-883, October.
    17. Yang, X. Q. & Goh, C. J., 1997. "A method for convex curve approximation," European Journal of Operational Research, Elsevier, vol. 97(1), pages 205-212, February.
    18. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(6), pages 1195-1198, December.
    19. ,, 1998. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 14(3), pages 381-386, June.
    20. ,, 1998. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 14(4), pages 525-537, August.
    21. J Figueira & H M'Silti & P Tolla, 1998. "Using mathematical programming heuristics in a multicriteria network flow context," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 49(8), pages 878-885, August.
    22. Current, John & Min, HoKey, 1986. "Multiobjective design of transportation networks: Taxonomy and annotation," European Journal of Operational Research, Elsevier, vol. 26(2), pages 187-201, August.
    23. ,, 1998. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 14(2), pages 285-292, April.
    24. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(2), pages 411-413, April.
    25. ,, 1998. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 14(1), pages 151-159, February.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Mohammad Ali Raayatpanah & Salman Khodayifar & Thomas Weise & Panos Pardalos, 2022. "A novel approach to subgraph selection with multiple weights on arcs," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 242-268, August.
    2. Mingue SUn, 2010. "A Branch-and-Bound Algorithm for Representative Integer Efficient Solutions in Multiple Objective Network Programming Problems," Working Papers 0007, College of Business, University of Texas at San Antonio.
    3. Moradi, Siamak & Raith, Andrea & Ehrgott, Matthias, 2015. "A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem," European Journal of Operational Research, Elsevier, vol. 244(2), pages 369-378.
    4. Eusébio, Augusto & Figueira, José Rui, 2009. "On the computation of all supported efficient solutions in multi-objective integer network flow problems," European Journal of Operational Research, Elsevier, vol. 199(1), pages 68-76, 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.
    1. Mingue SUn, 2010. "A Branch-and-Bound Algorithm for Representative Integer Efficient Solutions in Multiple Objective Network Programming Problems," Working Papers 0007, College of Business, University of Texas at San Antonio.
    2. Chein-Shan Liu & Zhuojia Fu & Chung-Lun Kuo, 2017. "Directional Method of Fundamental Solutions for Three-dimensional Laplace Equation," Journal of Mathematics Research, Canadian Center of Science and Education, vol. 9(6), pages 112-123, December.
    3. Marin, Liviu & Cipu, Corina, 2017. "Non-iterative regularized MFS solution of inverse boundary value problems in linear elasticity: A numerical study," Applied Mathematics and Computation, Elsevier, vol. 293(C), pages 265-286.
    4. Marc Peeters & Zeger Degraeve, 2004. "The Co-Printing Problem: A Packing Problem with a Color Constraint," Operations Research, INFORMS, vol. 52(4), pages 623-638, August.
    5. Minghe Sun, 2005. "Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 422-437, November.
    6. Sedeno-Noda, A. & Gonzalez-Martin, C. & Gutierrez, J., 2005. "The biobjective undirected two-commodity minimum cost flow problem," European Journal of Operational Research, Elsevier, vol. 164(1), pages 89-103, July.
    7. Albizuri, M.J. & Leroux, J. & Zarzuelo, J.M., 2010. "Updating claims in bankruptcy problems," Mathematical Social Sciences, Elsevier, vol. 60(2), pages 144-148, September.
    8. Minghe Sun, 2003. "Procedures for Finding Nondominated Solutions for Multiple Objective Network Programming Problems," Transportation Science, INFORMS, vol. 37(2), pages 139-152, May.
    9. Kazuhiro Takimoto, 2021. "Precise blowup rate near the boundary of boundary blowup solutions to k-Hessian equation," Partial Differential Equations and Applications, Springer, vol. 2(1), pages 1-10, February.
    10. Amit K. Verma & Biswajit Pandit & Lajja Verma & Ravi P. Agarwal, 2020. "A Review on a Class of Second Order Nonlinear Singular BVPs," Mathematics, MDPI, vol. 8(7), pages 1-50, June.
    11. Hovik A. Matevossian, 2020. "Asymptotics and Uniqueness of Solutions of the Elasticity System with the Mixed Dirichlet–Robin Boundary Conditions," Mathematics, MDPI, vol. 8(12), pages 1-32, December.
    12. Alves, Carlos J.S. & Valtchev, Svilen S., 2018. "On the application of the method of fundamental solutions to boundary value problems with jump discontinuities," Applied Mathematics and Computation, Elsevier, vol. 320(C), pages 61-74.
    13. Wong, Patricia J.Y., 2015. "Eigenvalues of a general class of boundary value problem with derivative-dependent nonlinearity," Applied Mathematics and Computation, Elsevier, vol. 259(C), pages 908-930.
    14. B. S. C. Campello & C. T. L. S. Ghidini & A. O. C. Ayres & W. A. Oliveira, 2022. "A residual recombination heuristic for one-dimensional cutting stock problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 194-220, April.
    15. Krzysztof C. Kiwiel, 2010. "An Inexact Bundle Approach to Cutting-Stock Problems," INFORMS Journal on Computing, INFORMS, vol. 22(1), pages 131-143, February.
    16. Lijun Wei & Zhixing Luo, & Roberto Baldacci & Andrew Lim, 2020. "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 428-443, April.
    17. Bin-Mohsin, B. & Lesnic, D., 2012. "Determination of inner boundaries in modified Helmholtz inverse geometric problems using the method of fundamental solutions," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 82(8), pages 1445-1458.
    18. Karageorghis, Andreas & Tappoura, Demetriana & Chen, C.S., 2021. "The Kansa RBF method with auxiliary boundary centres for fourth order boundary value problems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 181(C), pages 581-597.
    19. Lin, Ji & Zhao, Yuxiang & Watson, Daniel & Chen, C.S., 2020. "The radial basis function differential quadrature method with ghost points," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 173(C), pages 105-114.
    20. Peeters, Marc & Degraeve, Zeger, 2006. "Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem," European Journal of Operational Research, Elsevier, vol. 170(2), pages 416-439, April.

    More about this item

    Statistics

    Access and download statistics

    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:176:y:2007:i:3:p:1404-1422. 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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.