A discrete optimization approach to large scale supply networks based on partial differential equations

SIAM Journal on Scientific Computing

Volumn 30, Issue 3, 2007, Pages 1490-1507

  Fugenschuh A ^a   Gottlich S ^b   Herty, M ^b   Klar, A ^b,c   Martin, A ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

^c FRAUNHOFER INSTITUTE FOR INDUSTRIAL MATHEMATICS ITWM   (Germany)

Author keywords

Conservation laws; Networks; Optimization; Supply chains

Indexed keywords

OPTIMAL CONTROL SYSTEMS; ORDINARY DIFFERENTIAL EQUATIONS; PARTIAL DIFFERENTIAL EQUATIONS;

CONSERVATION LAW; DISCRETE OPTIMIZATION; LARGE-SCALES; MIXED INTEGER MODELS; NETWORK; NETWORK-BASED; OPTIMAL CONTROL PROBLEM; OPTIMISATIONS; OPTIMIZATION APPROACH; SUPPLY NETWORKS;

SUPPLY CHAINS;

EID: 55549121597     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/060663799     Document Type: Article

References (27)

1. E. D. ANDERSEN AND K. D. ANDERSEN, Presolving in linear programming, Math. Programming, 71 (1995), pp. 221-245.
2. D. ARMBRUSTER, P. DEGOND, AND C. RINGHOFER, A model for the dynamics of large queuing networks and supply chains, SIAM J. Appl. Math., 66 (2006), pp. 896-920.
3. D. ARMBRUSTER, P. DEGOND, AND C. RINGHOFER, Kinetic and fluid models for supply chains supporting policy attributes, Bull. Inst. Math. Acad. Sin. (N.S.), 2 (2007), pp. 433-460.
4. D. ARMBRUSTER, D. MARTHALER, AND C. RINGHOFER, Kinetic and fluid model hierarchies for supply chains, Multiscale Model. Simul., 2 (2003), pp. 43-61.
5. D. ARMBRUSTER, C. DE BEER, M. FREITAG, T. JAGALSKI, AND C. RINGHOFER, Autonomous control of production networks using a pheromone approach, Phys. A, 363 (2006), pp. 104-114.
6. R. E. BIXBY, D. SIMCHI-LEVI, A. MARTIN, AND U. ZIMMERMANN, Mathematics in the supply chain, Oberwolfach Rep., 1 (2004), pp. 963-1036.
7. R. E. BIXBY, M. FENELON, Z. GU, E. ROTHBERG, AND R. WUNDERLING, MIP: Theory and practice-closing the gap, in System Modelling and Optimization, Kluwer Academic, Boston, MA, 2000, pp. 19-49.
8. C. F. DAGANZO, A Theory of Supply Chains, Springer-Verlag, New York, Berlin, Heidelberg, 2003.
9. A. FÜGENSCHUH AND A. MARTIN, Computational integer programming and cutting planes, in Handbook on Discrete Optimization, K. Aardal, G. Nemhauser, and R. Weismantel, eds., Handbooks Oper. Res. Management Sci. 12, Elsevier, Amsterdam, 2005, pp. 69-122.
10. A. FÜGENSCHUH, M. HERTY, A. KLAR, AND A. MARTIN, Combinatorial and continuous models for the optimization of traffic flows on networks, SIAM J. Optim., 16 (2006), pp. 1155-1176.
11. R. E. GOMORY, An Algorithm for the Mixed Integer Problem, Tech Report RM-2597, The Rand Corporation, Santa Monica, CA, 1960.
12. S. GÖTTLICH, M. HERTY, AND A. KLAR, Network models for supply chains, Commun. Math. Sci., 3 (2005), pp. 545-559.
13. S. GÖTTLICH, M. HERTY, AND A. KLAR, Modelling and optimization of supply chains on complex networks, Commun. Math. Sci., 4 (2006), pp. 315-330.
14. Z. GU, G. L. NEMHAUSER, AND M. W. P. SAVELSBERGH, Lifted cover inequalities for 0-1 integer programs, INFORMS J. Comput., 10 (1998), pp. 427-437.
15. M. HERTY, A. KLAR, AND B. PICCOLI, Existence of solutions for supply chain models based on partial differential equations, SIAM J. Math. Anal., 39 (2007), pp. 160-173.
16. K. HOFFMAN AND M. PADBERG, Improving representations of zero-one linear programs for branch-and-cut, ORSA J. Comput., 3 (1991), pp. 121-134.
17. ILOG CPLEX Division, Incline Village, NV; information available at http://www.cplex.com.
18. C. KIRCHNER, M. HERTY, S. GÖTTLICH, AND A. KLAR, Optimal control for continuous supply network models, Netw. Heterog. Media, 1 (2006), pp. 675-688.
19. T. KOCH, Rapid Mathematical Programming, Ph.D. thesis, Technische Universitat Berlin, 2004; available online from http://edocs.tu- berlin.de/diss/2004/koch-thorsten.pdf.
20. J. LEE, J. LEUNG, AND F. MARGOT, Min-up/min-down polytopes, Discrete Optim., 1 (2004), pp. 77-85.
21. A. N. LETCHFORD, On disjunctive cuts for combinatorial optimization, J. Comb. Optim., 5 (2001), pp. 299-315.
22. H. MARCHAND AND L. A. WOLSEY, Aggregation and mixed integer rounding to solve MIPs, Oper. Res., 49 (2001), pp. 363-371.
23. G. NEMHAUSER AND L. A. WOLSEY, Integer and Combinatorial Optimization, Wiley-Interscience, New York, 1999.
24. M. W. PADBERG, T. J. VAN ROY, AND L. A. WOLSEY, Valid linear inequalities for fixed charged problems, Oper. Res., 33 (1985), pp. 842-861.
25. M. W. P. SAVELSBERGH, Preprocessing and probing for mixed integer programming problems, ORSA J. Comput., 6 (1994), pp. 445-454.
26. D. SIMCHI-LEVI, P. KAMINSKY, AND E. SIMCHI-LEVI, Managing the Supply Chain: The Definitive Guide for the Business, McGraw-Hill, New York, 2003.
27. S. TAKRITT, B. KRASENBRINK, AND L. S. Y. WU, Incorporating fuel constraints and electricity spot prices into the stochastic unit commitment problem, Oper. Res., 48 (2000), pp. 268-280.