IDEAS home Printed from https://ideas.repec.org/p/mit/sloanp/2201.html
   My bibliography  Save this paper

New scaling algorithms for the assignment and minimum cycle mean problems

Author

Listed:
  • Orlin, James B., 1953-.
  • Ahuja, Ravindra K., 1956-.

Abstract

No abstract is available for this item.

Suggested Citation

  • Orlin, James B., 1953-. & Ahuja, Ravindra K., 1956-., 1988. "New scaling algorithms for the assignment and minimum cycle mean problems," Working papers 2019-88., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    • Handle: RePEc:mit:sloanp:2201
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/1721.1/2201
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Ming S. Hung & Walter O. Rom, 1980. "Solving the Assignment Problem by Relaxation," Operations Research, INFORMS, vol. 28(4), pages 969-982, August.
    2. Richard M. Karp, 1977. "Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 209-224, August.
    3. M. L. Balinski, 1985. "Signature Methods for the Assignment Problem," Operations Research, INFORMS, vol. 33(3), pages 527-536, June.
    4. Nimrod Megiddo, 1979. "Combinatorial Optimization with Rational Objective Functions," Mathematics of Operations Research, INFORMS, vol. 4(4), pages 414-424, November.
    Full references (including those not matched with items on IDEAS)

    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. Ivan Belik & Kurt Jornsten, 2018. "Critical objective function values in linear sum assignment problems," Journal of Combinatorial Optimization, Springer, vol. 35(3), pages 842-852, April.
    2. Steffen Rebennack & Ashwin Arulselvan & Lily Elefteriadou & Panos M. Pardalos, 2010. "Complexity analysis for maximum flow problems with arc reversals," Journal of Combinatorial Optimization, Springer, vol. 19(2), pages 200-216, February.
    3. Bart Smeulders & Laurens Cherchye & Bram De Rock & Frits C. R. Spieksma, 2013. "The Money Pump as a Measure of Revealed Preference Violations: A Comment," Journal of Political Economy, University of Chicago Press, vol. 121(6), pages 1248-1258.
    4. Pritibhushan Sinha, 2009. "Assignment problems with changeover cost," Annals of Operations Research, Springer, vol. 172(1), pages 447-457, November.
    5. Kusum Deep & Hadush Mebrahtu & Atulya K. Nagar, 2018. "Novel GA for metropolitan stations of Indian railways when modelled as a TSP," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(3), pages 639-645, June.
    6. Hassin, Refael & Sarid, Anna, 2018. "Operations research applications of dichotomous search," European Journal of Operational Research, Elsevier, vol. 265(3), pages 795-812.
    7. Lenstra, J. K. & Rinnooy Kan, A. H. G., 1979. "Complexity Of Vehicle Routing And Scheduling Problems," Econometric Institute Archives 272191, Erasmus University Rotterdam.
    8. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    9. Pursals, Salvador Casadesús & Garzón, Federico Garriga, 2009. "Optimal building evacuation time considering evacuation routes," European Journal of Operational Research, Elsevier, vol. 192(2), pages 692-699, January.
    10. Chen, Liang & Tokuda, Naoyuki, 2001. "A faster data assignment algorithm for maximum likelihood-based multitarget motion tracking with bearings-only measurements," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 57(1), pages 109-120.
    11. Michael Holzhauser & Sven O. Krumke & Clemens Thielen, 2016. "Budget-constrained minimum cost flows," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1720-1745, May.
    12. Arora, Shalini & Puri, M. C., 1998. "A variant of time minimizing assignment problem," European Journal of Operational Research, Elsevier, vol. 110(2), pages 314-325, October.
    13. Ritter, Gunter & Pesch, Christoph, 2001. "Polarity-free automatic classification of chromosomes," Computational Statistics & Data Analysis, Elsevier, vol. 35(3), pages 351-372, January.
    14. Jianzhong Zhang & Zhenhong Liu, 2002. "A General Model of Some Inverse Combinatorial Optimization Problems and Its Solution Method Under l ∞ Norm," Journal of Combinatorial Optimization, Springer, vol. 6(2), pages 207-227, June.
    15. Evgeny Gurevsky & Sergey Kovalev & Mikhail Y. Kovalyov, 2021. "Min-max controllable risk problems," 4OR, Springer, vol. 19(1), pages 93-101, March.
    16. Sergio Cabello, 2023. "Faster distance-based representative skyline and k-center along pareto front in the plane," Journal of Global Optimization, Springer, vol. 86(2), pages 441-466, June.
    17. Andrés Gómez & Oleg A. Prokopyev, 2021. "A Mixed-Integer Fractional Optimization Approach to Best Subset Selection," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 551-565, May.
    18. Akiyoshi Shioura, 2015. "Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints," Mathematics of Operations Research, INFORMS, vol. 40(1), pages 192-225, February.
    19. Shoshana Anily, 1996. "The vehicle‐routing problem with delivery and back‐haul options," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(3), pages 415-434, April.
    20. Qin, Xiaolin & Tang, Juan & Feng, Yong & Bachmann, Bernhard & Fritzson, Peter, 2016. "Efficient index reduction algorithm for large scale systems of differential algebraic equations," Applied Mathematics and Computation, Elsevier, vol. 277(C), pages 10-22.

    More about this item

    Keywords

    HD28 .M414 no.2019-; 88;

    JEL classification:

    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:mit:sloanp:2201. 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: None (email available below). General contact details of provider: https://edirc.repec.org/data/ssmitus.html .

    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.