Abstract
In this chapter we improve the DC algorithm for general supermodular functions by using a pseudo-Boolean representation of the simple plant location problem (SPLP) presented in the previous chapters. It is common knowledge that exact algorithms for \(\mathcal{N}\mathcal{P}\)-hard problems in general, and for the SPLP in particular, spend only about 10 % of the execution time to find an optimal solution. The remaining time is spent proving the optimality of the solution. In this chapter, our aim is to reduce the amount of time spent proving the optimality of the solution obtained. We propose a data correcting algorithm for the SPLP that is designed to output solutions with a prespecified acceptable accuracy ε (see [53]).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
B. Albdaiwi, B. Goldengorin, G. Sierksma, Equivalent instances of the simple plant location problem. Comput. Math. Appl. 57(5), 812–820 (2009)
B.F. Albdaiwi, D. Ghosh, B. Goldengorin, Data aggregation for p-median problems. J. Comb. Optim. 21(3), 348–363 (2011)
A. Alcouffe, G. Muratet, Optimal location of plants. Manag. Sci. 23(3), 267–274 (1976)
Dj. A. Babayev, Comments on the note of frieze. Math. Program. 7, 249–252 (1974)
E. Balas, M.W. Padberg, On the set covering problem. Oper. Res. 20, 1152–1161 (1972)
E. Balas, P. Toth, Branch and bound methods, in The Traveling Salesman Problem, ed. by E.L. Lawler, J.K. Lenstra, A.G.H. Rinnooy Kan, D.B. Shmoys (Wiley, Chichester, 1985), pp. 361–401 (Chap. 10)
F. Barahona, M. Grötschel, M. Jünger, G. Reinelt, An application of combinatorial optimization to statistical physics and circuit layout design. Oper. Res. 36(3), 493–512 (1988)
F. Barahona, M. Jünger, G. Reinelt, Experiments in quadratic 0–1 programming. Math. Program. 44, 127–137 (1989)
J.E. Beasley. Lagrangean heuristics for location problems. Eur. J. Oper. Res. 65, 383–399 (1993)
J.E. Beasley, OR-Library, http://people.brunel.ac.uk/~mastjjb/jeb/info.html. Accessed March 2012
S. Benati, The maximum capture problem with heterogeneous customers. Comput. Oper. Res. 26(14), 1351–1367 (1999)
S. Benati, An Improved Branch & Bound Method for the Uncapacitated Competitive Location Problem. Annals. Oper. Res. 122(1–4), 43–58 (2003)
V.L. Beresnev, On a problem of mathematical standardization theory. Upravliajemyje Sist. 11, 43–54 (1973) (in Russian)
V.L. Beresnev, E. Kh. Gimadi, V.T. Dementyev, Extremal Standardization Problems (Nauka, Novosibirsk, 1978) (in Russian)
O. Bilde, J. Krarup, Sharp lower bounds and efficient algorithms for the simple plant location problem. Ann. Discr. Math. 1, 79–97 (1977)
A. Billionet, A. Sutter, Minimization of quadratic pseudo-Boolean function. Eur. J. Oper. Res. 78, 106–115 (1994)
A. Billionet, S. Elloumi, Using a Mixed Integer Programming Solver for the Unconstrained Qaudratic 0–1 Problem. Math. Progr. 109, 55–68, (2007)
T.B. Boffey, Graph Theory in Operations Research (Academic Press, London, UK, 1982)
Boolean Models and Methods in Mathematics, Computer Science, and Engineering (Yves Crama, Peter L. Hammer, eds.), Cambridge University Press, Cambridge (2010)
Boolean Functions: Theory, Algorithms, and Applications (Yves Crama, Peter L. Hammer, eds.), Cambridge University Press, Cambridge (2011)
E. Boros, P. Hammer, Cut-polytopes, Boolean quadratic polytopes and nonnegative quadratic pseudo-Boolean functions. Math. Oper. Res. 18(1), 245–253 (1993)
R.E. Burkard, V.G. Deineko, R. van Dal, J.A.A. van der Veen, G.J. Woeginger, Well-solvable special cases of the traveling salesman problem; a survey. SIAM Rev. 40(3), 496–546 (1998)
C. Canel, B.M. Khumawala, J. Law, A. Loh, An algorithm for the capacitated, multi-commodity, multi-period facility location problem. Comput. Oper. Res. 28, 411–427 (2001)
M.W. Carter, The indefinite zero-one quadratic problem. Discr. Appl. Math. 7, 23–44 (1984)
R. Carragan, P. Pardalos, An exact algorithm for the maximum clique problem. Oper. Res. Lett. 9, 375–382 (1990)
P. Chardaire, A. Sutter, A decomposition method for quadratic zero-one programming. Manag. Sci. 41(4), 704–712 (1995)
V.P. Cherenin, Mechanization of calculations for drawing up train gathering plans. Tekhnika Zheleznykh Dorog 1, 22–34 (1954) (in Russian)
V.P. Cherenin, Drawing up an optimal plan of gathering one-group trains using computers. Vestnik VNII Zheleznodorozhnogo Transp. 1, 21–24 (1961)
V.P. Cherenin, Solving some combinatorial problems of optimal planning by the method of successive calculations, in Proceedings of the Conference on Experiences and Perspectives of the Application of Mathematical Methods and Electronic Computers in Planning. Mimeograph, Novosibirsk, 1962 (in Russian)
D.C. Cho, E.L. Johnson, M.W. Padberg, M.R. Rao, On the uncapacitated plant location problem. I. Valid inequalities and facets. Math. Oper. Res. 8, 579–589 (1983)
D.C. Cho, M.W. Padberg, M.R. Rao, On the uncapacitated plant location problem. II. Facets and lifting theorems. Math. Oper. Res. 8, 590–612 (1983)
N. Christofides, Graph Theory: An Algorithmic Approach (Academic, London, 1975)
G. Cornuejols, M.L. Fisher, G.L. Nemhauser, On the uncapacitated location problem. Ann. Discr. Math. 1, 163–177 (1977)
G. Cornuejols, M.L. Fisher, G.L. Nemhauser, Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Manag. Sci. 23, 789–810 (1977)
G. Cornuejols, G.L. Nemhauser, L.A. Wolsey, The uncapacitated facility location problem, in Discrete Location Theory, ed. by R.L. Francis, P.B. Mirchandani (Wiley, New York, 1990) (Chap. 3)
G. Cornuejols, J.M. Thizy, A primal approach to the simple plant location problem. SIAM J. Algebraic Discr. Meth. 3, 504–510 (1982)
W.J. Cook, W.H. Cunningham, W.R. Polleyblank, A. Schrijver, Combinatorial Optimization (Wiley, New York, 1998)
P.M. Dearing, P.L. Hammer, B. Simeone, Boolean and graph theoretic formulations of the simple plant location problem. Transp. Sci. 26, 138–148 (1992)
R. Dechter, J. Pearl, Generalized best-first search strategies and the optimality of A ∗ . J. ACM 32, 505–536 (1985)
M. Dell’Amico, F. Maffioli, S. Martello (eds.), Annotated Bibliographies in Combinatorial Optimization (Wiley, Chichester, 1997)
A. Dolan, J. Aldous, Networks and Algorithms. An Introductory Approach (Wiley, Chichester, 1993)
J. Edmonds, Matroids, submodular functions, and certain polyhedra, in Combinatorial Structures and Their Applications, ed. by R.K. Guy, H. Hanani, N. Sauer, J. Schönheim (Gordon and Beach, New York, 1970), pp. 69–87
M.A. Efroymson, T.L. Ray, A branch-bound algorithm for plant location. Oper. Res. 14, 361–368 (1966)
D. Erlenkotter, A dual-based procedure for uncapacitated facility location. Oper. Res. 26, 992–1009 (1978)
A. Frank, Matroids and submodular functions, in Annotated Bibliographies in Combinatorial Optimization, ed. by M. Dell’Amico, F. Maffiolli, S. Martello (Wiley, New York, 1997), pp. 65–80
A.M. Frieze, A cost function property for plant location problems. Math. Program. 7, 245–248 (1974)
R.D. Galvão, L.A. Raggi, A method for solving to optimality uncapacitated location problems. Ann. Oper. Res. 18, 225–244 (1989)
M.R. Garey, D.S. Johnson, Computers and Intractability, a Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979)
R.S. Garfinkel, A.W. Neebe, M.R. Rao, An algorithm for the M-median plant location problem. Transp. Sci. 8, 217–236 (1974)
A.V. Genkin, I.B. Muchnik, Optimum algorithm for maximization of submodular functions. Autom. Remote Contr. USSR 51, 1121–1128 (1990)
R. Germs, B. Goldengorin, M. Turkensteen, Lower tolerance-based branch and bound algorithms for the ATSP. Comput. Oper. Res. 39(2), 291–298 (2012)
P.C. Gilmore, E.L. Lawler, D.B. Shmoys, Well-solved special cases, in The Traveling Salesman Problem, ed. by E.L. Lawler, J.K. Lenstra, A.G.H. Rinnooy Kan, D.B. Shmoys (Wiley, Chichester, 1985), pp. 87–143 (Chap. 4)
D. Ghosh, B. Goldengorin, G. Sierksma, Data correcting algorithms in combinatorial optimization, in The Handbook of Combinatorial Optimization, suppl. vol. B, ed. by D.-Z. Du, P.M. Pardalos (Springer, Berlin, 2005), pp. 1–53
D. Ghosh, B. Goldengorin, G. Sierksma, Data correcting: a methodology for obtaining near-optimal solutions, in Operations Research with Economic and Industrial Applications: Emerging Trends, ed. by S.R. Mohan, S.K. Neogy (Anamaya, New Delhi, 2005), pp. 119–127 (Chap. 9)
F. Glover, G.A. Kochenberger, B. Alidaee, Adaptive memory tabu search for binary quadratic programs. Manag. Sci. 44(3), 336–345 (1998)
B.I. Goldengorin, The design of optimal assortment for the vacuum diffusion welding sets. Standarty i Kachestvo 2, 19–21 (1975) (in Russian)
B. Goldengorin, Methods of solving multidimensional unification problems. Upravljaemye Sist. 16, 63–72 (1977) (in Russian)
B.I. Goldengorin, On the Stability of Solutions in Problems with a Single Component of Local Minima. Models and Methods of Solving Problems of Economic Systems Interaction (Nauka, Novosibirsk, 1982), pp. 149–160 (in Russian)
B.I. Goldengorin, A correcting algorithm for solving some discrete optimization problems. Soviet Math. Dokl. 27, 620–623 (1983)
B. Goldengorin, A correcting algorithm for solving allocation type problems. Autom. Remote Contr. 45, 590–598 (1984)
B. Goldengorin, Correcting algorithms for solving multivariate unification problems. Soviet J. Comput. Syst. Sci. 1, 99–103 (1985)
B.I. Goldengorin, A decomposition algorithm for the unification problem and new polynomially solvable cases. Soviet Math. Dokl. 33, 578–583 (1986)
B.I. Goldengorin, On the exact solution of unification problems by correcting algorithms. Soviet Phys. Dokl. 32, 432–434 (1987)
B. Goldengorin, Requirements of Standards: Optimization Models and Algorithms (Russian Operations Research, Hoogezand, 1995)
B. Goldengorin, G. Gutin, Polynomially solvable cases of the supermodular set function minimization problem. Research Report TR/6/98, Department of Mathematics and Statistics, Brunel University, Uxbridge, Middlesex, 1998, p. 5
B. Goldengorin, G. Sierksma, G.A. Tijssen, M. Tso, The data-correcting algorithm for minimization of supermodular functions. Manag. Sci. 45, 1539–1551 (1999)
B. Goldengorin, D. Ghosh, G. Sierksma, Improving the efficiency of branch and bound algorithms for the simple plant location problem. Lect. Notes Comput. Sci. 2141, 106–117 (2001)
B. Goldengorin, D. Ghosh, G. Sierksma, Branch and peg algorithms for the simple plant location problem. Comput. Oper. Res. 30, 967–981 (2003)
B. Goldengorin, G.A. Tijssen, D. Ghosh, G. Sierksma, Solving the simple plant location problem using a data correcting approach. J. Global Optim. 25(4), 377–406 (2003)
B. Goldengorin, G. Sierksma, Combinatorial optimization tolerances calculated in linear time. SOM Research Report 03A30, University of Groningen, Groningen, 2003, p. 6
B. Goldengorin, G. Sierksma, M. Turkensteen, Tolerance based algorithms for the ATSP. Lect. Notes Comput. Sci. 3353, 222–234 (2005)
B. Goldengorin, D. Ghosh, The multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem. J. Global Optim. 32(1), 65–82 (2005)
B. Goldengorin, Maximization of submodular functions: theory and enumeration algorithms. Eur. J. Oper. Res. 198, 102–112 (2009)
B. Goldengorin, D. Krushinsky, Complexity evaluation of benchmark instances for the p-median problem. Math. Comput. Model. 53(9–10), 1719–1736 (2011)
B. Goldengorin, D. Krushinsky, A computational study of the pseudo-Boolean approach to the p-median problem applied to cell formation. Lect. Notes Comput. Sci. 6701, 503–516 (2011)
R.P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied Introduction, 3rd edn. (Addison-Wesley, New York, 1994)
M. Guignard, K. Spielberg, Algorithms for exploiting the structure of the simple plant location problem. Ann. Discr. Math. 1, 247–271 (1977)
G. Gutin, A.P. Punnen, The Traveling Salesman Problem and Its Variations (Kluwer Academic, Dordrecht, 2002)
P. Hammer, Some network flow problems solved with pseudo-Boolean programming. Oper. Res. 13, 388–399 (1965)
P.L. Hammer, Plant location—a pseudo-Boolean approach. Isr. J. Technol. 6, 330–332 (1968)
P. Hammer, S. Rudeanu, Boolean Methods in Operations Research and Related Areas (Springer, Berlin, 1968)
J. Håstad, Some optimal in-approximability results, in Proceedings 29th Annual ACM Symposium on Theory of Computation, (El Paso, Tex., May 4–6). ACM, New York, 1–10 (1997)
M. Held, P. Wolfe, H.P. Crowder, Validation of subgradient optimization. Math. Program. 6, 62–88 (1974)
P.C. Jones, T.J. Lowe, G. Muller, N. Xu, Y. Ye, J.L. Zydiak, Specially structured uncapacitated facility location problems. Oper. Res. 43, 661–669 (1995)
S.N. Kabadi, Polynomially solvable cases of the TSP, in The Traveling Salesman Problem and Its Variations, ed. by G. Gutin, A.P. Punnen (Kluwer Academic, Dordrecht, 2002), pp. 489–583 (Chap. 11)
F. Kalantari, A. Bagchi, An algorithm for quadratic zero one. Technical Report LCSR-TR-112, Department of Computer Science, Rutgers University, 1988
R.M. Karp, Reducibility among combinatorial problems, in Complexity of Computer Computations, ed. by R.E. Miller, J.W. Thatcher (Plenum, New York, 1972), pp. 85–103
R.M. Karp, A patching algorithm for the nonsymmetric traveling salesman problem. SIAM J. Comput. 8(4), 561–573 (1979)
V.R. Khachaturov, Some problems of the successive calculation method and its applications to location problems. Ph.D Thesis, Central Economics & Mathematics Institute, Russian Academy of Sciences, Moscow, 1968 (in Russian)
V.R. Khachaturov, Mathematical Methods of Regional Programming (Nauka, Moscow, 1989) (in Russian)
B.M. Khumawala, An efficient branch and bound algorithm for the warehouse location problem. Manag. Sci. 18, B718–B731 (1972)
C.-W. Ko, J. Lee, M. Queyranne, An exact algorithm for maximum entropy sampling. Oper. Res. 43, 684–691 (1995)
M. Körkel, On the exact solution of large-scale simple plant location problems. Eur. J. Oper. Res. 39, 157–173 (1989)
B. Korte, J. Vygen, Combinatorial Optimization. Theory and Algorithms (Springer, Berlin, 2000)
J. Krarup, P.M. Pruzan, The simple plant location problem: a survey and synthesis. Eur. J. Oper. Res. 12, 36–81 (1983)
A. Krause, SFO: a toolbox for submodular function optimization. J. Mach. Learn. Res. 11, 1141–1144 (2010)
H.W. Kuhn, The Hungarian method for the assignment problem. Naval Res. Logist. Q. 2, 83–97 (1955)
M. Labbé, F.V. Louveaux, Location problems, in Annotated Bibliographies in Combinatorial Optimization, ed. by M. Dell’Amico, F. Maffioli, S. Martello (Wiley, Chichester, 1997), pp. 264–271 (Chap. 16)
M. Laurent, Max-cut problem, in Annotated Bibliographies in Combinatorial Optimization, ed. by M. Dell’Amico M, F. Maffioli, S. Martello (Wiley, Chichester, 1997), pp. 241–259 (Chap. 15)
E.L. Lawler, J.K. Lenstra, A.G.H. Rinnooy Kan, D.B. Shmoys, The Traveling Salesman Problem (Wiley, Chichester, 1985)
J. Lee, Constrained maximum-entropy sampling. Oper. Res. 46, 655–664 (1998)
H. Lee, G.L. Nemhauser, Y. Wang, Maximizing a submodular function by integer programming: polyhedral results for the quadratic case. Eur. J. Oper. Res. 94, 154–166 (1996)
L. Lovasz, Submodular functions and convexity, in Mathematical Programming: The State of the Art, ed. by A. Bachem, M. Grötschel, B. Korte (Springer, Berlin, 1983), pp. 235–257
C.K. Martin, L. Scharge, Subset coefficient reduction cuts for 0–1 mixed integer programming. Oper. Res. 33, 505–526 (1985)
M. Minoux, Accelerated greedy algorithms for maximizing submodular set functions, in Actes Congres IFIP, ed. by J. Stoer (Springer, Berlin, 1977), pp. 234–243
J.G. Morris, On the extent to which certain fixed charge depot location problems can be solved by LP. J. Oper. Res. Soc. 29, 71–76 (1978)
C. Mukendi, Sur l’Implantation d’Èquipement dans un Reseu: Le Problème de m-Centre. Thesis, University of Grenoble, 1975
K.G. Murty, An algorithm for ranking all the assignments in order of increasing cost. Oper. Res. 16, 682–687 (1968)
G.L. Nemhauser, L.A. Wolsey, M.L. Fisher, An analysis of approximations for maximizing submodular set functions—I. Math. Program. 14, 265–294 (1978)
G.L. Nemhauser, L.A. Wolsey, Maximization submodular set functions: formulations and analysis of algorithms, in Studies on Graphs and Discrete Programming, ed. by P. Hansen (North-Holland, Amsterdam, 1981), pp. 279–301
G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization (Wiley, New York, 1988)
E.D. Nering, A.W. Tucker, Linear Programs and Related Problems (Academic, San Diego, 1993)
M. Padberg, The Boolean quadratic polytope: some characteristics, facets and relatives. Math. Program. 45, 139–172 (1989)
P.M. Pardalos, G.P. Rodgers, Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 40, 131–144 (1990)
P.M. Pardalos, F. Rendl, H. Wolkowicz, The quadratic assignment problem: a survey and recent developments. DIMACS Ser. Discr. Math. Theor. Comput. Sci. 16, 1–42 (1994)
D.W. Pentico, The assortment problem with nonlinear cost functions. Oper. Res. 24, 1129–1142 (1976)
D.W. Pentico, The discrete two-dimensional assortment problem. Oper. Res. 36, 324–332 (1988)
A. Petrov, V. Cherenin, An improvement of train gathering plans design methods. Zheleznodorozhnyi Transp. 3, 60–71 (1948) (in Russian)
S. Poljak, F. Rendl, Node and edge relaxations of the max-cut problem. Computing 52, 123–137 (1994)
S. Poljak, F. Rendl, Solving the max-cut problem using eigenvalues. Discr. Appl. Math. 62, 249–278 (1995)
G. Reinelt, TSPLIB 95 (1995), http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/. Accessed April 2012
C.S. ReVelle, H.A. Eiselt, M.S. Daskin, A bibliography for some fundamental problem categories in discrete location science. Eur. J. Oper. Res. 184, 817–848 (2008)
C.S. Revelle, G. Laporte, The plant location problem: new models and research prospects. Oper. Res. 44, 864–874 (1996)
F. Rendl, G. Rinaldi, A. Wiegele, Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations. Math. Progr. 121, 307–335, (2010)
T.G. Robertazzi, S.C. Schwartz, An accelerated sequential algorithm for producing D-optimal designs. SIAM J. Sci. Stat. Comput. 10, 341–358 (1989)
L. Schrage, Implicit representation of variable upper bounds in linear programming. Math. Program. Study 4, 118–132 (1975)
A. Schrijver, A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Comb. Theor. Ser. B 80(2), 346–355 (2000)
A. Tripathy, H. Süral, Y. Gerchak, Multidimensional assortment problem with an application. Networks 33, 239–245 (1999)
V.A. Trubin, On a method of solution of integer programming problems of a special kind. Soviet Math. Dokl. 10, 1544–1546 (1969)
M. Turkensteen, D. Ghosh, B.Goldengorin, G. Sierksma, Tolerance-based branch and bound algorithms for the ATSP. Eur. J. Oper. Res. 189, 775–788 (2008)
E.S. van der Poort, Aspects of sensitivity analysis for the traveling salesman problem. Ph.D. Thesis, SOM Graduate School, University of Groningen (Labyrint Publication, Capelle a/d IJssel, 1997)
T.J. Van Roy, L.A. Wolsey, Valid inequalities for mixed 0–1 programs. Discr. Appl. Math. 14, 199–213 (1986)
V.E. Veselovsky, Some algorithms for solution of a large-scale allocation problem. Ekonomika i Matematicheskije Metody 12, 732–737 (1977) (in Russian)
A.C. Williams, Quadratic 0–1 programming using the roof dual with computational results. RUTCOR Research Report 8-85, Rutgers University, 1985
D.P. Williamson, Lecture Notes on Approximation Algorithms. IBM Research Report (IBM Research Division, T.J. Watson Research Center, Yorktown Heights, Spring 1998)
W. Zhang, R.E. Korf, Performance of linear-space search algorithms. Artif. Intell. 79, 241–292 (1995)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Boris Goldengorin, Panos M. Pardalos
About this chapter
Cite this chapter
Goldengorin, B., Pardalos, P.M. (2012). Data Correcting Approach for the Simple Plant Location Problem. In: Data Correcting Approaches in Combinatorial Optimization. SpringerBriefs in Optimization. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-5286-7_4
Download citation
DOI: https://doi.org/10.1007/978-1-4614-5286-7_4
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-5285-0
Online ISBN: 978-1-4614-5286-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)