Von der FakultII { Mathematik und Naturwissenschaften der Technischen UniversitBerlin zur Erlangung des akademischen Grades

[1]  S. Bikhchandani,et al.  Weak Monotonicity Characterizes Deterministic Dominant-Strategy Implementation , 2006 .

[2]  Gerald L. Thompson.  An Integral Simplex Algorithm for Solving Combinatorial Optimization Problems , 2002, Comput. Optim. Appl..

[3]  Angelina Vidali,et al.  A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing , 2010, ESA.

[4]  G. Parisi,et al.  Random walk in a random environment and 1f noise , 1983 .

[5]  B. Moldovanu,et al.  Efficient Design with Interdependent Valuations , 2001 .

[6]  Matthias Gunkel,et al.  Cost modeling and evaluation of capital expenditures in optical multilayer networks , 2008 .

[7]  Martin W. P. Savelsbergh,et al.  Preprocessing and Probing Techniques for Mixed Integer Programming Problems , 1994, INFORMS J. Comput..

[8]  Ofer Zeitouni,et al.  Random Walks in Random Environment , 2009, Encyclopedia of Complexity and Systems Science.

[9]  J. Bouchaud,et al.  Anomalous diffusion in disordered media: Statistical mechanisms, models and physical applications , 1990 .

[10]  Richard E. Goodrick,et al.  Non-simplicially collapsible triangulations of In , 1968, Mathematical Proceedings of the Cambridge Philosophical Society.

[11]  Dimitri P. Bertsekas,et al.  Stochastic optimal control : the discrete time case , 2007 .

[12]  Manfred W. Padberg,et al.  Almost Perfect Matrices and Graphs , 1998 .

[13]  Antonio Capone,et al.  Multi-layer MPLS network design: The impact of statistical multiplexing , 2008, Comput. Networks.

[14]  Karol Borsuk.  Drei Sätze über die n-dimensionale euklidische Sphäre , 1933 .

[15]  Alain-Sol Sznitman,et al.  On a Class Of Transient Random Walks in Random Environment , 2001 .

[16]  E. Anderson,et al.  Some Properties of a Class of Continuous Linear Programs , 1983 .

[17]  N. Shimkin,et al.  Topological Uniqueness of the Nash Equilibrium for Atomic Selflsh Routing , 2005 .

[18]  W. Lickorish,et al.  Piecewise linear critical levels and collapsing , 1972 .

[19]  Paul R. Milgrom,et al.  Bid, ask and transaction prices in a specialist market with heterogeneously informed traders , 1985 .

[20]  C. Helmberg.  Semidefinite Programming for Combinatorial Optimization , 2000 .

[21]  Malcolm Craig Pullan,et al.  A Study of General Dynamic Network Programs with Arc Time-Delays , 1997, SIAM J. Optim..

[22]  T. Pennanen,et al.  Reduced form modeling of limit order markets , 2010, 1006.4517.

[23]  Martin Skutella,et al.  An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times , 2006, Algorithmica.

[24]  U. Pachner,et al.  Konstruktionsmethoden und das kombinatorische Homöomorphieproblem für Triangulationen kompakter semilinearer Mannigfaltigkeiten , 1987 .

[25]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[26]  Peter Petersen,et al.  Bounding homotopy types by geometry , 1988 .

[27]  R Bellman,et al.  Bottleneck Problems and Dynamic Programming. , 1953, Proceedings of the National Academy of Sciences of the United States of America.

[28]  Guido Schäfer,et al.  Cost Sharing Methods for Makespan and Completion Time Scheduling , 2007, STACS.

[29]  Eytan Modiano,et al.  Reducing electronic multiplexing costs in SONET/WDM rings with dynamically changing traffic , 2000, IEEE Journal on Selected Areas in Communications.

[30]  Harry Kesten,et al.  A limit law for random walk in a random environment , 1975 .

[31]  David Mayers,et al.  The effect of large block transactions on security prices: A cross-sectional analysis , 1987 .

[32]  Misha Gromov,et al.  Spaces and Questions , 2010 .

[33]  Bernhard Korte,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

[34]  Ofer Zeitouni,et al.  Lectures on probability theory and statistics , 2004 .

[35]  Tobias Achterberg,et al.  Constraint integer programming , 2007 .

[36]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[37]  Franklin Allen,et al.  Stock Price Manipulation, Market Microstructure and Asymmetric Information , 1991 .

[38]  U. Brehm.  Maximally symmetric polyhedral realizations of Dyck's regular map , 1987 .

[39]  Éva Tardos,et al.  The effect of collusion in congestion games , 2006, STOC '06.

[40]  L. Tournier,et al.  Reversed Dirichlet environment and directional transience of random walks in Dirichlet random environment , 2009, 0905.3917.

[41]  K. Grove,et al.  Erratum to Geometric finiteness theorems via controlled topology , 1991 .

[42]  Alexander Schied,et al.  Optimal execution strategies in limit order books with general shape functions , 2007, 0708.1756.

[43]  Evripidis Bampis,et al.  Approximation schemes for minimizing average weighted completion time with release dates , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[44]  Franz Merkl,et al.  A Zero-One Law for Planar Random walks in Random Environment , 2001 .

[45]  Jeff Cheeger,et al.  Critical points of distance functions and applications to geometry , 1991 .

[46]  Eytan Modiano,et al.  Survivable routing of logical topologies in WDM networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[47]  Gang Yu,et al.  OPERATIONS RESEARCH IN THE AIRLINE INDUSTRY. , 1998 .

[48]  Leen Stougie,et al.  Multiprocessor scheduling with rejection , 1996, SODA '96.

[49]  S. Pallottino,et al.  Shortest Path Algorithms in Transportation models: classical and innovative aspects , 1997 .

[50]  Jiri Matousek,et al.  Topological lower bounds for the chromatic number: A hierarchy , 2003 .

[51]  Michael R. Bussieck,et al.  Discrete optimization in public rail transport , 1997, Math. Program..

[52]  Thomas F. Loeb.  Trading Cost: The Critical Link Between Investment Information and Results , 1983 .

[53]  Tim Roughgarden,et al.  Bottleneck links, variable demand, and the tragedy of the commons , 2006, SODA 2006.

[54]  Martin Desrochers,et al.  A Column Generation Approach to the Urban Transit Crew Scheduling Problem , 1987, Transp. Sci..

[55]  P. Mani,et al.  Shellable Decompositions of Cells and Spheres. , 1971 .

[56]  Noam Nisan,et al.  Algorithmic Mechanism Design , 2001, Games Econ. Behav..

[57]  David W. Barnette,et al.  Manifolds with few vertices , 1976, Discret. Math..

[58]  Alexandre F. Roch,et al.  Liquidity risk, price impacts and the replication problem , 2008, Finance Stochastics.

[59]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[60]  Biswanath Mukherjee,et al.  Traffic grooming in an optical WDM mesh network , 2002, IEEE J. Sel. Areas Commun..

[61]  Tim Roughgarden,et al.  The Price of Stability for Network Design with Fair Cost Allocation , 2004, FOCS.

[62]  Nicholas C. Wormald,et al.  THE ASYMPTOTIC NUMBER OF CONVEX POLYHEDRA , 1982 .

[63]  Leonidas J. Guibas,et al.  The Centroid of Points with Approximate Weights , 1995, ESA.

[64]  Stefan Voß,et al.  A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks , 2006, Eur. J. Oper. Res..

[65]  Xiaodong Luo.  Continuous linear programming : theory, algorithms and applications , 1995 .

[66]  Refael Hassin,et al.  Approximation algorithms and hardness results for labeled connectivity problems , 2007, J. Comb. Optim..

[67]  A note about bistellar operations on PL-manifolds with boundary , 1995 .

[68]  George N. Rouskas,et al.  A Survey of Virtual Topology Design Algorithms for Wavelength Routed Optical Networks , 1999 .

[69]  Danny Raz,et al.  A simple efficient approximation scheme for the restricted shortest path problem , 2001, Oper. Res. Lett..

[70]  S. Chopra.  On the spanning tree polyhedron , 1989 .

[71]  T. Regge.  General relativity without coordinates , 1961 .

[72]  Christos H. Papadimitriou,et al.  Algorithms, games, and the internet , 2001, STOC '01.

[73]  J. W. Suurballe.  Disjoint paths in a network , 1974, Networks.

[74]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[75]  B. Sturmfels.  Computational Synthetic Geometry , 1989 .

[76]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[77]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[78]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[79]  Louis J. Billera,et al.  Shellability of Interval Orders , 1998 .

[80]  Harry Kesten,et al.  Sums of stationary sequences cannot grow slower than linearly , 1975 .

[81]  L. Rogers,et al.  THE COST OF ILLIQUIDITY AND ITS EFFECTS ON HEDGING , 2010 .

[82]  Jay E. Aronson,et al.  A survey of dynamic network flows , 1989 .

[83]  Andrew V. Goldberg,et al.  Negative-cycle detection algorithms , 1996, Math. Program..

[84]  Leena Suhl,et al.  A time-space network based exact optimization model for multi-depot bus scheduling , 2006, Eur. J. Oper. Res..

[85]  Joel Hasbrouck,et al.  Measuring the Information Content of Stock Trades , 1991 .

[86]  Seiki Kyan,et al.  Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem , 1986, SIAM J. Comput..

[87]  Deepak K. Merchant,et al.  A Model and an Algorithm for the Dynamic Traffic Assignment Problems , 1978 .

[88]  Wayne D. Grover,et al.  Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking , 2003 .

[89]  G. Mitra,et al.  Integrated Decision Support Systems for Urban Transport Scheduling: Discussion of Implementation and Experience , 1988 .

[90]  David G. Wilson,et al.  2. Constrained Optimization , 2005 .

[91]  Sebastian Orlowski,et al.  Local and global restoration of node and link failures in telecommunication networks , 2003 .

[92]  Jian Wang,et al.  Improved approaches for cost-effective traffic grooming in WDM ring networks: ILP formulations and single-hop and multihop connections , 2001 .

[93]  Aranyak Mehta,et al.  Fairness and optimality in congestion games , 2005, EC '05.

[94]  Critical Properties of Some Discrete Random Surface Models , 1990 .

[95]  Thomas L. Magnanti,et al.  Shortest paths, single origin-destination network design, and associated polyhedra , 1993, Networks.

[96]  Robert Kissell,et al.  Algorithmic Decision-Making Framework , 2005, Algorithmic Trading Methods.

[97]  Amir Dembo,et al.  Large Deviations Techniques and Applications , 1998 .

[98]  Lisa Fleischer,et al.  Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions , 2005, Math. Oper. Res..

[99]  Ariel Orda,et al.  Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990, JACM.

[100]  Bruce Hoppe,et al.  Efficient Dynamic Network Flow Algorithms , 1995 .

[101]  Martin Skutella,et al.  Quickest Flows Over Time , 2007, SIAM J. Comput..

[102]  David Eppstein,et al.  Flipping Cubical Meshes , 2001, Engineering with Computers.

[103]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[104]  Ted K. Ralphs,et al.  Noncommercial Software for Mixed-Integer Linear Programming , 2005 .

[105]  P. Nash,et al.  A Class of Continuous Network Flow Problems , 1982, Math. Oper. Res..

[106]  Large deviations and phase transition for random walks in random nonnegative potentials , 2006, math/0609766.

[107]  A. Bouma,et al.  Linienplanung und Simulation für öffentliche Verkehrswege in Praxis und Theorie , 1994 .

[108]  José R. Correa,et al.  Network Games with Atomic Players , 2006, ICALP.

[109]  Richard Ehrenborg,et al.  The topology of the independence complex , 2006, Eur. J. Comb..

[110]  Avishai Ceder,et al.  Timetable Synchronization for Buses , 1999 .

[111]  Andreas Bley,et al.  Planung kostenoptimaler Informations- und Kommunikations-Infrastrukturen , 2003 .

[112]  W. L. Wilkinson,et al.  An Algorithm for Universal Maximal Dynamic Flows in a Network , 1971, Oper. Res..

[113]  Imre Bárány,et al.  On a Topological Generalization of a Theorem of Tverberg , 1981 .

[114]  K. Onaga,et al.  On feasibility conditions of multicommodity flows in networks , 1971 .

[115]  Andreas Bley,et al.  Multi-layer Network Design - A Model-Based Optimization Approach , 2008 .

[116]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[117]  J. Matousek,et al.  Using The Borsuk-Ulam Theorem , 2007 .

[118]  Egon Balas,et al.  Octane: A New Heuristic for Pure 0-1 Programs , 2001, Oper. Res..

[119]  Michael H. Freedman,et al.  The topology of four-dimensional manifolds , 1982 .

[120]  C. S. Sung,et al.  Branch-and-price algorithm for a combined problem of virtual path establishment and traffic packet routing in a layered communication network , 2003, J. Oper. Res. Soc..

[121]  Martin Scharlemann,et al.  Chapter 18 – Heegaard Splittings of Compact 3-Manifolds , 2000, math/0007144.

[122]  D. M. Ryan,et al.  Express: Set Partitioning for Bus Crew Scheduling in Christchurch , 1992 .

[123]  Berthold Vöcking,et al.  Fast convergence to Wardrop equilibria by adaptive sampling methods , 2006, STOC '06.

[124]  Which 4-manifolds are toric varieties? , 1994 .

[125]  Anna A. Obizhaeva.  Information vs. Liquidity: Evidence from Portfolio Transition Trades , 2007 .

[126]  Rolf H. Möhring,et al.  A Case Study in Periodic Timetabling , 2002, ATMOS.

[127]  Torbjörn Larsson,et al.  Side constrained traffic equilibrium models: analysis, computation and applications , 1999 .

[128]  A. Fomenko,et al.  THE PROBLEM OF DISCRIMINATING ALGORITHMICALLY THE STANDARD THREE-DIMENSIONAL SPHERE , 1974 .

[129]  Akio Kawauchi,et al.  A Survey of Knot Theory , 1996 .

[130]  Jian Wang,et al.  Improved Approaches for Cost-Effective Traffic Grooming in WDM Ring Networks: Uniform-Traffic Case* , 2001, Photonic Network Communications.

[131]  Andreas T. Ernst,et al.  Rail Crew Scheduling and Rostering Optimization Algorithms , 2001 .

[132]  Alexander Schied,et al.  Risk Aversion and the Dynamics of Optimal Liquidation Strategies in Illiquid Markets , 2008 .

[133]  H. S. M. Coxeter,et al.  Regular Skew Polyhedra in Three and Four Dimension, and their Topological Analogues , 1938 .

[134]  H. Witsenhausen,et al.  Some solvable stochastic control problemst , 1980 .

[135]  Dmitry N. Kozlov,et al.  Complexes of Directed Trees , 1999, J. Comb. Theory A.

[136]  Robert L. Smith,et al.  A MIXED INTEGER LINEAR PROGRAMMING MODEL FOR DYNAMIC ROUTE GUIDANCE , 1998 .

[137]  Werner Ebeling,et al.  Diffusion and reaction in random media and models of evolution processes , 1984 .

[138]  Ellis L. Johnson.  Modelling and strong linear programs for mixed integer programming , 1989 .

[139]  Hua He,et al.  Dynamic Trading Policies with Price Impact , 2001 .

[140]  Andrew Vince.  A Non-Shellable 3-Sphere , 1985, Eur. J. Comb..

[141]  M. Zerner.  The zero-one law for planar random walks in i.i.d. random environments revisited , 2007, 0706.0745.

[142]  R. Wessäly.  Dimensioning Survivable Capacitated Networks , 2000 .

[143]  Jian-Qiang Hu,et al.  Diverse routing in optical mesh networks , 2003, IEEE Trans. Commun..

[144]  Arie M. C. A. Koster,et al.  Availability and Cost Based Evaluation of Demand-wise Shared Protection , 2006 .

[145]  Victor Klee,et al.  The d-Step Conjecture and Its Relatives , 1987, Math. Oper. Res..

[146]  Jacques Desrosiers,et al.  Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems , 1998, Transp. Sci..

[147]  R. D. Richtmyer,et al.  Difference methods for initial-value problems , 1959 .

[148]  Scott A. Mitchell.  The All-Hex Geode-Template for Conforming a Diced Tetrahedral Mesh to any Diced Hexahedral Mesh , 1999, Engineering with Computers.

[149]  Martin Gairing,et al.  Exact Price of Anarchy for Polynomial Congestion Games , 2006, STACS.

[150]  Andreas T. Ernst,et al.  An Annotated Bibliography of Personnel Scheduling and Rostering , 2004, Ann. Oper. Res..

[151]  Katherine Crowley,et al.  Simplicial collapsibility, discrete Morse theory, and the geometry of nonpositively curved simplicial complexes , 2008 .

[152]  Damir Filipović,et al.  Affine Diffusion Processes: Theory and Applications , 2009, 0901.4003.

[153]  Lawrence Harris,et al.  Price and Volume Effects Associated with Changes in the S&P 500 List: New Evidence for the Existence of Price Pressures , 1986 .

[154]  Ori Gerstel,et al.  Combined WDM and SONET network design , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[155]  Francis Lazarus,et al.  Optimal pants decompositions and shortest homotopic cycles on an orientable surface , 2003, JACM.

[156]  Kurt M. Anstreicher.  Generation of feasible descent directions in continuous time linear programming , 1983 .

[157]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[158]  Lawrence Bodin,et al.  A Matching Based Heuristic for Scheduling Mass Transit Crews and Vehicles , 1983 .

[159]  Claude Le Pape,et al.  Exploring relaxation induced neighborhoods to improve MIP solutions , 2005, Math. Program..

[160]  Terry L. Friesz,et al.  A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem , 1993, Oper. Res..

[161]  Xiaoqiang Cai,et al.  Time-varying shortest path problems with constraints , 1997 .

[162]  Nikhil Bansal,et al.  Scheduling for Flow-Time with Admission Control , 2003, ESA.

[163]  G. Ziegler,et al.  Many triangulated 3-spheres , 2002, math/0212004.

[164]  Costas Busch,et al.  Atomic routing games on maximum congestion , 2006, Theor. Comput. Sci..

[165]  Lamberto Cesari,et al.  Optimization-Theory And Applications , 1983 .

[166]  Matteo Fischetti,et al.  A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems , 2001, Manag. Sci..

[167]  Nico M. van Dijk,et al.  Cost optimal allocation of rail passenger lines , 1998, Eur. J. Oper. Res..

[168]  Günter M. Ziegler,et al.  Construction and Analysis of Projected Deformed Products , 2010, Discret. Comput. Geom..

[169]  T. Magnanti,et al.  Polyhedral properties of the network restoration problem-with the convex hull of a special case , 1997 .

[170]  Antonio Sassano,et al.  A Lagrangian-based heuristic for large-scale set covering problems , 1998, Math. Program..

[171]  Günter M. Ziegler,et al.  Neighborly Cubical Polytopes , 2000, Discret. Comput. Geom..

[172]  Itzhak Gilboa,et al.  Source Sink Flows with Capacity Installation in Batches , 1998, Discret. Appl. Math..

[173]  Kumar N. Sivarajan,et al.  Optical Networks: A Practical Perspective , 1998 .

[174]  Maureen O'Hara,et al.  PRICE, TRADE SIZE, AND INFORMATION IN SECURITIES MARKETS* , 1987 .

[175]  Nitin Walia,et al.  Optimal Trading: Dynamic Stock Liquidation Strategies , 2006 .

[176]  Robert Kissell,et al.  Optimal Trading Strategies: Quantitative Approaches for Managing Market Impact and Trading Risk , 2003 .

[177]  Jian Liu,et al.  Solving Real-Life Railroad Blocking Problems , 2007, Interfaces.

[178]  Annamária Kovács,et al.  Fast Monotone 3-Approximation Algorithm for Scheduling Related Machines , 2005, ESA.

[179]  S. Kamei.  Cones over the boundaries of nonshellable but constructible 3-balls , 2004 .

[180]  J. Morgan,et al.  Ricci Flow and the Poincare Conjecture , 2006, math/0607607.

[181]  Gregory F. Lawler,et al.  Random Walk: A Modern Introduction , 2010 .

[182]  M. Herzberg,et al.  An optimal spare-capacity assignment model for survivable networks with hop limits , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[183]  Dennis Huisman,et al.  Models and Algorithms for Integration of Vehicle and Crew Scheduling , 2000, J. Sched..

[184]  Robert L. Smith,et al.  User-equilibrium properties of fixed points in dynamic traffic assignment 1 1 This research was supp , 1998 .

[185]  Marc E. Pfetsch,et al.  Competitive Online Multicommodity Routing , 2006, Theory of Computing Systems.

[186]  J. Bernasconi,et al.  Classical Diffusion in One-Dimensional Disordered Lattice , 1978 .

[187]  Jan Ambjørn,et al.  Three-dimensional simplicial quantum gravity , 1992 .

[188]  Walter Ukovich,et al.  A Mathematical Model for Periodic Scheduling Problems , 1989, SIAM J. Discret. Math..

[189]  L. Jack,et al.  BAGEHOT, Walter (pseudonym for TREYNOR), . The Only Game In Journal, , . , 1971 .

[190]  Raman Sanyal.  Topological obstructions for vertex numbers of Minkowski sums , 2009, J. Comb. Theory, Ser. A.

[191]  Matias Courdurier.  On stars and links of shellable polytopal complexes , 2006, J. Comb. Theory, Ser. A.

[192]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

[193]  Sebastian Orlowski,et al.  The Effect of Hop Limits on Optimal Cost in Survivable Network Design , 2006 .

[194]  Berthold Vöcking,et al.  Tight bounds for worst-case equilibria , 2002, SODA '02.

[195]  Gideon Weiss,et al.  A simplex based algorithm to solve separated continuous linear programs , 2008, Math. Program..

[196]  Frederick Solomon.  Random Walks in a Random Environment , 1975 .

[197]  Jim Gatheral.  No-dynamic-arbitrage and market impact , 2009 .

[198]  G. Perakis,et al.  The Price of Anarchy when Costs Are Non-separable and Asymmetric , 2004, IPCO.

[199]  Louis J. Billera,et al.  Neighborly cubical spheres and a cubical lower bound conjecture , 1997 .

[200]  Sugato Chakravarty,et al.  Stealth-trading : Which traders ’ trades move stock prices ? , 2001 .

[201]  Simplicial quantum gravity in three dimensions: Analytical and numerical results. , 1993, Physical review. D, Particles and fields.

[202]  Alain-Sol Sznitman,et al.  Slowdown estimates and central limit theorem for random walks in random environment , 2000 .

[203]  Nigel H. Wilson,et al.  Computer-Aided Transit Scheduling , 1999, Lecture Notes in Economics and Mathematical Systems.

[204]  Malcolm Craig Pullan,et al.  An extended algorithm for separated continuous linear programs , 2002, Math. Program..

[205]  J. Ambjorn,et al.  Crumpled triangulations and critical points in 4D simplicial quantum gravity , 1998 .

[206]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[207]  R. Gomory.  AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .

[208]  James R. Munkres,et al.  Elements of algebraic topology , 1984 .

[209]  Andre F. Perold,et al.  The implementation shortfall , 1988 .

[210]  Anita Schöbel,et al.  Line Planning with Minimal Traveling Time , 2005, ATMOS.

[211]  E. K. Park,et al.  An Algorithm for Traffic Grooming in WDM Optical Mesh Networks with Multiple Objectives , 2005, Telecommun. Syst..

[212]  Andrew C. Ho,et al.  Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study , 1980 .

[213]  Arie M. C. A. Koster,et al.  Single-Layer Cuts for Multi-Layer Network Design Problems , 2008 .

[214]  J. Milnor.  Fifty Years Ago: Topology of Manifolds in the 50's and 60's , 2006 .

[215]  Elise Miller-Hooks,et al.  On Solving Quickest Time Problems in Time-Dependent, Dynamic Networks , 2004, J. Math. Model. Algorithms.

[216]  Arie M. C. A. Koster,et al.  Two-layer Network Design by Branch-and-Cut featuring MIP-based Heuristics , 2006 .

[217]  Guy Desaulniers,et al.  Multi-depot vehicle scheduling problems with time windows and waiting costs , 1996, Eur. J. Oper. Res..

[218]  Hamid Gharavi,et al.  Multilevel video coding and distribution architectures for emerging broadband digital networks , 1996, IEEE Trans. Circuits Syst. Video Technol..

[219]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[220]  Martin W. P. Savelsbergh,et al.  Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition , 2000, INFORMS J. Comput..

[221]  R. Bixby,et al.  On the Solution of Traveling Salesman Problems , 1998 .

[222]  Volkmar Welker,et al.  Constructions preserving evasiveness and collapsibility , 1999, Discret. Math..

[223]  Aravind Srinivasan,et al.  Cost-Sharing Mechanisms for Network Design , 2007, Algorithmica.

[224]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[225]  Ismail Chabini,et al.  Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time , 1998 .

[226]  Tullio Regge,et al.  Discrete structures in gravity , 2000 .

[227]  Arnaud Knippel,et al.  The multi-layered network design problem , 2007, Eur. J. Oper. Res..

[228]  Monte Carlo simulations of 4d simplicial quantum gravity , 1995, hep-lat/9504004.

[229]  Martin Skutella,et al.  Minimum cost flows over time without intermediate storage , 2003, SODA '03.

[230]  André F. Perold.  Extreme Points and Basic Feasible Solutions in Continuous Time Linear Programming , 1981 .

[231]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .

[232]  Igal Milchtaich,et al.  Generic Uniqueness of Equilibrium in Large Crowding Games , 2000, Math. Oper. Res..

[233]  Nimrod Megiddo.  Combinatorial Optimization with Rational Objective Functions , 1979, Math. Oper. Res..

[234]  George N. Rouskas,et al.  Traffic grooming in WDM networks: past and future , 2002, IEEE Netw..

[235]  André F. Perold.  Fundamentals of a continuous time simplex method , 1979 .

[236]  T. Kurtz.  Approximation of Population Processes , 1987 .

[237]  I. Bárány.  LECTURES ON DISCRETE GEOMETRY (Graduate Texts in Mathematics 212) , 2003 .

[238]  Susanne Albers,et al.  Online algorithms: a survey , 2003, Math. Program..

[239]  Leo G. Kroon,et al.  Decision Support Systems Support the Search for Win-Win Solutions in Railway Network Design , 1999, Interfaces.

[240]  Mary Ellen Rudin,et al.  An unshellable triangulation of a tetrahedron , 1958 .

[241]  M. Stoer,et al.  A polyhedral approach to multicommodity survivable network design , 1994 .

[242]  J. Bernasconi,et al.  Excitation Dynamics in Random One-Dimensional Systems , 1981 .

[243]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[244]  Martin Grötschel,et al.  A Column-Generation Approach to Line Planning in Public Transport , 2007, Transp. Sci..

[245]  G. Ziegler.  Lectures on Polytopes , 1994 .

[246]  R. Borndörfer,et al.  Aspects of Set Packing, Partitioning, and Covering , 1998 .

[247]  Gur Huberman,et al.  Optimal Liquidity Trading , 2000 .

[248]  Thorsten Koch,et al.  Branching rules revisited , 2005, Oper. Res. Lett..

[249]  D. Hochbaum.  Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems , 1996 .

[250]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[251]  Günter M. Ziegler,et al.  Projected products of polygons , 2004 .

[252]  Kerry Back,et al.  Insider Trading in Continuous Time , 1992 .

[253]  Steven E. Shreve,et al.  Optimal Execution in a General One-Sided Limit-Order Book , 2011, SIAM J. Financial Math..

[254]  F. Waldhausen.  Heegaard-Zerlegungen der 3-sphäre , 1968 .

[255]  Frank den Hollander,et al.  Branching random walk in random environment: phase transitions for local and global growth rates , 1992 .

[256]  Imre Bárány,et al.  A Short Proof of Kneser's Conjecture , 1978, J. Comb. Theory, Ser. A.

[257]  Jean-Philippe Bouchaud,et al.  Fluctuations and Response in Financial Markets: The Subtle Nature of 'Random' Price Changes , 2003 .

[258]  J. Pfeifle.  Extremal Constructions for Polytopes and Spheres , 2003 .

[259]  Éva Tardos,et al.  Truthful mechanisms for one-parameter agents , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[260]  Jochen Könemann,et al.  From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem , 2005, ICALP.

[261]  Aravind Srinivasan,et al.  Cost-Sharing Mechanisms for Network Design , 2004, APPROX-RANDOM.

[262]  E. H. Clarke.  Multipart pricing of public goods , 1971 .

[263]  Jaromir Abrham,et al.  Numerical solutions to continuous linear programming problems , 1973, Z. Oper. Research.

[264]  Francisco Barahona,et al.  The volume algorithm: producing primal solutions with a subgradient method , 2000, Math. Program..

[265]  George N. Rouskas,et al.  On optimal traffic grooming in WDM rings , 2002, IEEE J. Sel. Areas Commun..

[266]  Egon Schulte,et al.  Polyhedral Maps , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[267]  Discrete Morse Complexes , 2000, math/0011234.

[268]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[269]  R. Frey.  Derivative Asset Analysis in Models with Level-Dependent and Stochastic Volatility , 1997 .

[270]  Michael Hinterm.  A Proximal Bundle Method Based on Approximate Subgradients , 2001 .

[271]  Jonas Holmerin,et al.  Clique Is Hard to Approximate within n1-o(1) , 2000, ICALP.

[272]  Michael R. Bussieck,et al.  A fast algorithm for near cost optimal line plans , 2004, Math. Methods Oper. Res..

[273]  A. I. Mees,et al.  Continuous-time shortest path problems with stopping and starting costs , 1992 .

[274]  Thorsten Koch,et al.  Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Miplib 2003 , 2022 .

[275]  R. van Nes,et al.  Importance of Objectives in Urban Transit-Network Design , 2000 .

[276]  Amarjit Budhiraja,et al.  Convergent Numerical Scheme for Singular Stochastic Control with State Constraints in a Portfolio Selection Problem , 2007, SIAM J. Control. Optim..

[277]  Richard Ehrenborg,et al.  Non-constructible Complexes and the Bridge Index , 2001, Eur. J. Comb..

[278]  R. Pollack,et al.  There are asymptotically far fewer polytopes than we thought , 1986 .

[279]  Arie M. C. A. Koster,et al.  On the strength of cut-based inequalities for capacitated network design polyhedra , 2007 .

[280]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[281]  Sonoko Moriyama,et al.  h-Assignments of simplicial complexes and reverse search , 2006, Discret. Appl. Math..

[282]  Martin Desrochers,et al.  Computer-Aided Transit Scheduling , 1992 .

[283]  Kerstin Fritzsche,et al.  More polytopes meeting the conjectured Hirsch bound , 1999, Discret. Math..

[284]  J. R. Daduna.  Impacts of Deregulation on Planning Processes and Information Management Design in Public Transit , 2001 .

[285]  R. Loll,et al.  Discrete Approaches to Quantum Gravity in Four Dimensions , 1998, Living reviews in relativity.

[286]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[287]  B. Sturmfels.  Oriented Matroids , 1993 .

[288]  Barbara B. Simons,et al.  Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines , 1983, SIAM J. Comput..

[289]  L. Harris.  Trading and Exchanges: Market Microstructure for Practitioners , 2002 .

[290]  Ryan Porter,et al.  Mechanism design for online real-time scheduling , 2004, EC '04.

[291]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[292]  Richard J. Gibbens,et al.  Resource pricing and the evolution of congestion control , 1999, at - Automatisierungstechnik.

[293]  Cynthia Barnhart,et al.  Transportation Service Network Design: Models and Algorithms , 1999 .

[294]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[295]  Michal Pióro,et al.  Design Models for Robust Multi-Layer Next Generation Internet Core Networks Carrying Elastic Traffic , 2005, Journal of Network and Systems Management.

[296]  François Soumis,et al.  A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem , 2001, Oper. Res..

[297]  Eytan Modiano,et al.  Survivable lightpath routing: a new approach to the design of WDM-based networks , 2002, IEEE J. Sel. Areas Commun..

[298]  Ioannis Karatzas,et al.  Brownian Motion and Stochastic Calculus , 1987 .

[299]  José R. Correa,et al.  Sloan School of Management Working Paper 4319-03 June 2003 Selfish Routing in Capacitated Networks , 2022 .

[300]  Jerold B. Warner,et al.  Stealth trading and volatility , 1993 .

[301]  Allan Borodin,et al.  On the power of randomization in on-line algorithms , 2005, Algorithmica.

[302]  David E. Kaufman,et al.  Minimum travel time paths in dynamic networks with application to intelligent vehicle/highway systems , 1990 .

[303]  S. Armentrout.  Knots and shellable cell partitionings of $S^{3}$ , 1994 .

[304]  Arie M. C. A. Koster,et al.  Tight LP-based lower bounds for wavelength conversion in optical networks , 2007 .

[305]  Éva Tardos,et al.  Efficient continuous-time dynamic network flow algorithms , 1998, Oper. Res. Lett..

[306]  Jialin Yu,et al.  High Frequency Market Microstructure Noise Estimates and Liquidity Measures , 2009 .

[307]  J. W. Cannon,et al.  Shrinking cell-like decompositions of manifolds. Codimension three , 1979 .

[308]  Igal Milchtaich,et al.  Topological Conditions for Uniqueness of Equilibrium in Networks , 2005, Math. Oper. Res..

[309]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[310]  Ariel Orda,et al.  Competitive routing in multiuser communication networks , 1993, TNET.

[311]  Galen H. Sasaki,et al.  Minimal cost WDM network for incremental traffic , 1999, Optics East.

[312]  Suresh Subramaniam,et al.  Survivable embedding of logical topologies in WDM ring networks , 2003, Inf. Sci..

[313]  Anders Björner,et al.  Posets, Regular CW Complexes and Bruhat Order , 1984, Eur. J. Comb..

[314]  Gur Huberman,et al.  Price Manipulation and Quasi-Arbitrage , 2004 .

[315]  A. Gibbard.  Manipulation of Voting Schemes: A General Result , 1973 .

[316]  Jason P. Jue,et al.  Minimum-color path problems for reliability in mesh networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[317]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

[318]  Stella C. Dafermos,et al.  Traffic assignment problem for a general network , 1969 .

[319]  Rüdiger Frey,et al.  Perfect option hedging for a large trader , 1998, Finance Stochastics.

[320]  Lyapunov exponents for the one-dimensional parabolic Anderson model with drift , 2008, 0803.1480.

[321]  E. C. Zeeman,et al.  On the dunce hat , 1963 .

[322]  Eli Berger,et al.  A note on the edge cover number and independence number in hypergraphs , 2008, Discret. Math..

[323]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[324]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[325]  Francisco Barahona,et al.  Network Design Using Cut Inequalities , 1996, SIAM J. Optim..

[326]  Tim Roughgarden,et al.  New trade-offs in cost-sharing mechanisms , 2006, STOC '06.

[327]  Péter Csorba,et al.  Box complexes, neighborhood complexes, and the chromatic number , 2004, J. Comb. Theory, Ser. A.

[328]  Leo G. Kroon,et al.  A Branch-and-Cut Approach for Solving Railway Line-Planning Problems , 2004, Transp. Sci..

[329]  J. Teasdale.  A tool of the trade , 1990, Nature.

[330]  Florian Schoppmann,et al.  Wardrop Equilibria and Price of Stability for Bottleneck Games with Splittable Traffic , 2006, WINE.

[331]  Edward A. Bender,et al.  The Asymptotic Number of Rooted Maps on a Surface. II. Enumeration by Vertices and Faces , 1993, J. Comb. Theory, Ser. A.

[332]  Laurence A. Wolsey,et al.  Aggregation and Mixed Integer Rounding to Solve MIPs , 2001, Oper. Res..

[333]  Jon M. Kleinberg,et al.  Single-source unsplittable flow , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[334]  Bruce N Janson,et al.  Dynamic traffic assignment for urban road networks , 1991 .

[335]  D. Bertsimas,et al.  A New Algorithm for State-Constrained Separated Continuous Linear Programs , 1999 .

[336]  Thomas L. Magnanti,et al.  Modeling and Solving the Two-Facility Capacitated Network Loading Problem , 1995, Oper. Res..

[337]  J. Hudson.  Piecewise linear topology , 1966 .

[338]  Michael Joswig,et al.  Neighborly cubical polytopes and spheres , 2005 .

[339]  V. R. Konda,et al.  Algorithm for traffic grooming in optical networks to minimize the number of transceivers , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

[340]  Claude Lemaréchal,et al.  Lagrangian Relaxation , 2000, Computational Combinatorial Optimization.

[341]  Milind Dawande,et al.  A Traffic-Grooming Algorithm for Wavelength-Routed Optical Networks , 2007, INFORMS J. Comput..

[342]  Ludwig B. Chincarini.  The Amaranth Debacle , 2007 .

[343]  Ori Gerstel,et al.  Cost effective traffic grooming in WDM rings , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[344]  John N. Tsitsiklis,et al.  A scalable network resource allocation mechanism with bounded efficiency loss , 2006, IEEE Journal on Selected Areas in Communications.

[345]  Refael Hassin,et al.  Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..

[346]  M.G.C. van Krieken,et al.  A Lagrangean Relaxation Based Algorithm for Solving Set Partitioning Problems , 2004 .

[347]  D. Ahn,et al.  A Parametric Nonlinear Model of Term Structure Dynamics , 1999 .

[348]  Yin Zhang,et al.  On selfish routing in internet-like environments , 2006, TNET.

[349]  Rainer E. Burkard,et al.  The quickest flow problem , 1993, ZOR Methods Model. Oper. Res..

[350]  Tim Roughgarden,et al.  Selfish routing and the price of anarchy , 2005 .

[351]  Robert Almgren,et al.  Optimal execution of portfolio trans-actions , 2000 .

[352]  G. Perelman.  The entropy formula for the Ricci flow and its geometric applications , 2002, math/0211159.

[353]  Alain-Sol Sznitman,et al.  A law of large numbers for random walks in random environment , 1999 .

[354]  Jean-Christophe Aval,et al.  Multivariate Fuss-Catalan numbers , 2007, Discret. Math..

[355]  Berthold Vöcking,et al.  Adaptive routing with stale information , 2005, PODC '05.

[356]  Olaf Korn,et al.  Market Depth and Order Size , 1999 .

[357]  A. Löbel.  Solving Large-Scale Real-World Minimum-Cost Flow Problems by a Network Simplex Method , 1996 .

[358]  Robert D. Doverspike,et al.  Comparison of capacity efficiency of DCS network restoration routing techniques , 1994, Journal of Network and Systems Management.

[359]  Peter McMullen,et al.  Polyhedral 2-manifolds inE3 with unusually large genus , 1983 .

[360]  David Kempe,et al.  Auctions for Share-Averse Bidders , 2008, WINE.

[361]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[362]  C.G. Gruber,et al.  A computational study for demand-wise shared protection , 2005, DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005..

[363]  Rudra Dutta.  Virtual Topology Design for Traffic Grooming in WDM Networks , 2001 .

[364]  Rama Cont,et al.  A Stochastic Model for Order Book Dynamics , 2008, Oper. Res..

[365]  Jacques Desrosiers,et al.  On Compact Formulations for Integer Programs Solved by Column Generation , 2005, Ann. Oper. Res..

[366]  Thorsten Koch,et al.  Rapid mathematical programming , 2005 .

[367]  Alexander Engström,et al.  Discrete Morse Functions from Fourier Transforms , 2009, Exp. Math..

[368]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[369]  D. R. Fulkerson,et al.  Constructing Maximal Dynamic Flows from Static Flows , 1958 .

[370]  Florian Schoppmann,et al.  To Be or Not to Be (Served) , 2007, WINE.

[371]  D. Bertsimas,et al.  Optimal control of execution costs , 1998 .

[372]  László Lovász,et al.  Kneser's Conjecture, Chromatic Number, and Homotopy , 1978, J. Comb. Theory A.

[373]  S. Molchanov.  Ideas in the theory of random media , 1991 .

[374]  Marcus Pattloch,et al.  Modellierung und Optimierung der X-WiN Plattform , 2005 .

[375]  Ariel Orda,et al.  Minimum weight paths in time-dependent networks , 1991, Networks.

[376]  Patrice Marcotte,et al.  A Strategic Flow Model of Traffic Assignment in Static Capacitated Networks , 2004, Oper. Res..

[377]  R. Rosenthal.  A class of games possessing pure-strategy Nash equilibria , 1973 .

[378]  A. Kyle.  Continuous Auctions and Insider Trading , 1985 .

[379]  Oktay Günlük,et al.  Capacitated Network Design - Polyhedral Structure and Computation , 1996, INFORMS J. Comput..

[380]  Tim Roughgarden,et al.  Selfish routing with atomic players , 2005, SODA '05.

[381]  Michael Poss,et al.  An improved Benders decomposition applied to a multi-layer network design problem , 2009, Oper. Res. Lett..

[382]  Antonio Frangioni,et al.  Generalized Bundle Methods , 2002, SIAM J. Optim..

[383]  Koya Shimokawa,et al.  TANGLE SUM AND CONSTRUCTIBLE SPHERES , 2004 .

[384]  Martin Desrochers,et al.  CREW-OPT: Subproblem Modeling in a Column Generation Approach to Urban Crew Scheduling , 1992 .

[385]  R. Lowenstein.  When Genius Failed: The Rise and Fall of Long-Term Capital Management , 2000 .

[386]  Robert G. Busacker,et al.  A PROCEDURE FOR DETERMINING A FAMILY OF MINIMUM-COST NETWORK FLOW PATTERNS , 1960 .

[387]  Tatsuya Suda,et al.  iREX: Inter-Domain Resource Exchange Architecture , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[388]  Jean-Yves Le Boudec,et al.  Design of a survivable WDM photonic network , 1997, Proceedings of INFOCOM '97.

[389]  Stan Uryasev,et al.  Optimal Security Liquidation Algorithms , 2005, Comput. Optim. Appl..

[390]  H. Demsetz,et al.  The Cost of Transacting , 1968 .

[391]  On the interpretation of 1/f noise , 1983 .

[392]  D. Rolfsen.  Knots and Links , 2003 .

[393]  J. Scott Provan,et al.  Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra , 1980, Math. Oper. Res..

[394]  Matthew J. Saltzman,et al.  Parallel branch, cut, and price for large-scale discrete optimization , 2003, Math. Program..

[395]  Jochen Könemann,et al.  Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree , 2006, STOC '06.

[396]  Stefan E. Karisch,et al.  Airline Crew Rostering: Problem Types, Modeling, and Optimization , 2004, Ann. Oper. Res..

[397]  A. Björner.  Shellable and Cohen-Macaulay partially ordered sets , 1980 .

[398]  S. Kalikow,et al.  GENERALIZED RANDOM WALK IN A RANDOM ENVIRONMENT , 1981 .

[399]  S. M. Hashemi,et al.  ON SOLVING DYNAMIC SHORTEST PATH PROBLEMS , 2008 .

[400]  Alexander Schied,et al.  Constrained portfolio liquidation in a limit order book model , 2008 .

[401]  Nicos Christofides,et al.  An algorithm for the resource constrained shortest path problem , 1989, Networks.

[402]  António Guedes de Oliveira,et al.  On the Generation of Oriented Matroids , 2000, Discret. Comput. Geom..

[403]  Mechthild Stoer,et al.  Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints , 1992, SIAM J. Optim..

[404]  J. George Shanthikumar,et al.  Convex separable optimization is not much harder than linear optimization , 1990, JACM.

[405]  Martin Skutella,et al.  An Introduction to Network Flows over Time , 2008, Bonn Workshop of Combinatorial Optimization.

[406]  Ariel Orda,et al.  Bottleneck Routing Games in Communication Networks , 2007, IEEE J. Sel. Areas Commun..

[407]  Sebastian Orlowski,et al.  Comparing Restoration Concepts Using Optimal Network Configurations with Integrated Hardware and Routing Decisions , 2005, Journal of Network and Systems Management.

[408]  Erik Andersson,et al.  Crew Pairing Optimization , 1998 .

[409]  Maddalena Nonato,et al.  An Integrated Approach to Extra-Urban Crew and Vehicle Scheduling* , 1998 .

[410]  A. Sznitman.  An effective criterion for ballistic behavior of random walks in random environment , 2002 .

[411]  N. Mnev.  The universality theorems on the classification problem of configuration varieties and convex polytopes varieties , 1988 .

[412]  Edward Minieka,et al.  Maximal, Lexicographic, and Dynamic Network Flows , 1973, Oper. Res..

[413]  Guido Schäfer,et al.  Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems , 2008, SAGT.

[414]  Erwin Bolthausen,et al.  On the Satic and Dynamic Points of View for Certain Random Walks in Random Environment , 2002 .

[415]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[416]  Bruce Kleiner,et al.  Notes on Perelman's papers , 2006 .

[417]  Cynthia A. Phillips,et al.  Minimizing average completion time in the presence of release dates , 1998, Math. Program..

[418]  Alexander Schied,et al.  TRANSIENT LINEAR PRICE IMPACT AND FREDHOLM INTEGRAL EQUATIONS , 2010 .

[419]  Roland Wunderling.  Paralleler und Objektorientierter Simplex , 1996 .

[420]  Anne Verroust-Blondet,et al.  Computing a canonical polygonal schema of an orientable triangulated surface , 2001, SCG '01.

[421]  M. Desrochers,et al.  A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows , 1988 .

[422]  Roy S. Smith,et al.  An inexact bundle method for solving large structured linear matrix inequalities , 2001 .

[423]  Jeremy H. Large.  Measuring the resiliency of an electronic limit order book , 2007 .

[424]  Sebastian Orlowski,et al.  An Integer Programming Model for Multi-Layer Network Design , 2004 .

[425]  Michelle L. Wachs,et al.  On lexicographically shellable posets , 1983 .

[426]  Lisa Fleischer,et al.  Faster Algorithms for the Quickest Transshipment Problem , 2001, SIAM J. Optim..

[427]  J. Matousek,et al.  Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry , 2007 .

[428]  Jean-Claude Bermond,et al.  Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3 , 2003, Networks.

[429]  Robert Furch,et al.  Zur grundlegung der kombinatorischen topologie , 1924 .

[430]  M. Pullan.  A Duality Theory for Separated Continuous Linear Programs , 1996 .

[431]  W. T. Tutte,et al.  A Census of Planar Triangulations , 1962, Canadian Journal of Mathematics.

[432]  Jordi Brandts,et al.  Centre De Referència En Economia Analítica Barcelona Economics Working Paper Series Working Paper Nº 58 Price Competition under Cost Uncertainty: a Laboratory Analysis Price Competition under Cost Uncertainty: a Laboratory Analysis , 2022 .

[433]  John N. Tsitsiklis,et al.  Efficiency loss in a network resource allocation game: the case of elastic supply , 2004, IEEE Transactions on Automatic Control.

[434]  Terry L. Friesz,et al.  Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem , 1989, Oper. Res..

[435]  J. Stillwell.  Classical topology and combinatorial group theory , 1980 .

[436]  Dennis Huisman,et al.  Vehicle and crew scheduling: solving large real-world instances with an integrated approach , 2008 .

[437]  Martin Skutella,et al.  Flows over time with load-dependent transit times , 2002, SODA '02.

[438]  Paul G. Spirakis,et al.  Atomic Congestion Games Among Coalitions , 2006, ICALP.

[439]  W. B. R. Lickorish,et al.  Triangulations of the $3$-ball with knotted spanning $1$-simplexes and collapsible $r$th derived subdivisions , 1969 .

[440]  P. Protter,et al.  Modeling Credit Risk with Partial Information , 2004, math/0407060.

[441]  Florian Schoppmann,et al.  Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location , 2008, SAGT.

[442]  Michal Pióro,et al.  SNDlib 1.0—Survivable Network Design Library , 2010, Networks.

[443]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[444]  Tim Roughgarden,et al.  The price of anarchy is independent of the network topology , 2002, STOC '02.

[445]  Andrew B. Philpott,et al.  Continuous-Time Flows in Networks , 1990, Math. Oper. Res..

[446]  Jürgen Richter-Gebert.  Realization Spaces of Polytopes , 1996 .

[447]  Vijay V. Vazirani,et al.  Applications of approximation algorithms to cooperative games , 2001, STOC '01.

[448]  P. McMullen,et al.  Constructions for projectively unique polytopes , 1976, Discret. Math..

[449]  Christian Raack,et al.  Employing Mixed-Integer Rounding in Telecommunication Network Design , 2005 .

[450]  Andreas S. Schulz,et al.  Network flow problems and congestion games: complexity and approximation results , 2006 .

[451]  Mohammad Mahdian,et al.  Externalities in online advertising , 2008, WWW.

[452]  Mohammad Taghi Hajiaghayi,et al.  Oblivious network design , 2006, SODA '06.

[453]  Martin Gairing,et al.  Total Latency in Singleton Congestion Games , 2007, WINE.

[454]  E. J. Anderson.  Extreme Points for Continuous Network Programs with Arc Delays , 1989 .

[455]  H. Komiya.  Elementary proof for Sion's minimax theorem , 1988 .

[456]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[457]  Tim Roughgarden,et al.  Selfish Routing , 2002 .

[458]  P. Francesco.  2D QUANTUM GRAVITY,MATRIX MODELS AND GRAPH COMBINATORICS , 2004, math-ph/0406013.

[459]  Tim Roughgarden,et al.  Optimal Efficiency Guarantees for Network Design Mechanisms , 2007, IPCO.

[460]  Drew Fudenberg,et al.  Open-loop and closed-loop equilibria in dynamic games with many players , 1988 .

[461]  Katta G. Murty,et al.  Computational complexity of parametric linear programming , 1980, Math. Program..

[462]  Edward J. Anderson,et al.  Purification for separated continuous linear programs , 1996, Math. Methods Oper. Res..

[463]  P. Protter.  Stochastic integration and differential equations , 1990 .

[464]  Andy Philpott,et al.  On the Solutions of a Class of Continuous Linear Programs , 1994 .

[465]  Luca Trevisan,et al.  Non-approximability results for optimization problems on bounded degree instances , 2001, STOC '01.

[466]  Andy Philpott,et al.  Network Programming in Continuous Time with Node Storage , 1985 .

[467]  Theodore Groves,et al.  Incentives in Teams , 1973 .

[468]  J. Nash.  NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.

[469]  Byrav Ramamurthy,et al.  Survivable virtual topology routing under shared risk link groups in WDM networks , 2004, First International Conference on Broadband Networks.

[470]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[471]  B. Rosenow,et al.  Order book approach to price impact , 2003, cond-mat/0311457.

[472]  Michael E. Saks,et al.  Weak monotonicity suffices for truthfulness on convex domains , 2005, EC '05.

[473]  Daliborka Stanojevic.  Optimization of Contemporary Telecommunications Networks: Generalized Spanning Trees and WDM Optical Networks , 2005 .

[474]  Alexander Martin,et al.  General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms , 2000, Computational Combinatorial Optimization.

[475]  Duane J. Seppi,et al.  Episodic Liquidity Crises: Cooperative and Predatory Trading , 2007 .

[476]  David R. Karger,et al.  Techniques for scheduling with rejection , 2003, J. Algorithms.

[477]  Wayne D. Grover,et al.  Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks , 1998, TNET.

[478]  Tibor Cinkler,et al.  Heuristic algorithms for joint configuration of the optical and electrical layer in multi-hop wavelength routing networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[479]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[480]  Éva Tardos,et al.  Near-optimal network design with selfish agents , 2003, STOC '03.

[481]  Guido Schäfer,et al.  Online Cooperative Cost Sharing , 2010, CIAC.

[482]  M. Pullan.  An algorithm for a class of continuous linear programs , 1993 .

[483]  J. Pratt.  RISK AVERSION IN THE SMALL AND IN THE LARGE11This research was supported by the National Science Foundation (grant NSF-G24035). Reproduction in whole or in part is permitted for any purpose of the United States Government. , 1964 .

[484]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[485]  Yishay Mansour,et al.  Fast convergence of selfish rerouting , 2005, SODA '05.

[486]  Paolo Toth,et al.  A Global Method for Crew Planning in Railway Applications , 2001 .

[487]  Maddalena Nonato,et al.  Network Models, Lagrangean Relaxation and Subgradients Bundle Approach in Crew Scheduling Problems , 1995 .

[488]  Mauro Brunato,et al.  Reactive Search for Traffic Grooming in WDM Networks , 2001, IWDC.

[489]  Marc E. Pfetsch,et al.  Computing Optimal Morse Matchings , 2006, SIAM J. Discret. Math..

[490]  Gauthier Lafruit,et al.  Adaptive 3D Content for Multi-Platform On-Line Games , 2007, CW 2007.

[491]  T. Hibi.  Union and glueing of a family of Cohen-Macaulay partially ordered sets , 1987, Nagoya Mathematical Journal.

[492]  Martin Skutella,et al.  The Quickest Multicommodity Flow Problem , 2002, IPCO.

[493]  Maureen O'Hara,et al.  Market Microstructure Theory , 1995 .

[494]  A. C. Pigou.  Economics of welfare , 1920 .

[495]  James W. Walker,et al.  Canonical Homeomorphisms of Posets , 1988, Eur. J. Comb..

[496]  Jean-Marc Rousseau,et al.  Hastus: A Model For The Economic Evaluation of Drivers’ Collective Agreements In Transit Companies* , 1982 .

[497]  Edward J. Anderson,et al.  A continuous-time network simplex algorithm , 1989, Networks.

[498]  José R. Correa,et al.  On the Inefficiency of Equilibria in Congestion Games , 2005, IPCO.

[499]  M. Fisher,et al.  Optimal solution of set covering/partitioning problems using dual heuristics , 1990 .

[500]  Adrian S. Lewis,et al.  An extension of the simplex algorithm for semi-infinite linear programming , 1989, Math. Program..

[501]  L. F. Martins,et al.  Numerical Methods for Stochastic Singular Control Problems , 1991 .

[502]  George L. Nemhauser,et al.  Optimality Conditions for a Dynamic Traffic Assignment Model , 1978 .

[503]  A. Lewis.  Extreme Points and Purification Algorithms in General Linear Programming , 1985 .

[504]  E. Fama.  EFFICIENT CAPITAL MARKETS: A REVIEW OF THEORY AND EMPIRICAL WORK* , 1970 .

[505]  Lars Schewe.  Generation of Oriented Matroids Using Satisfiability Solvers , 2006, ICMS.

[506]  Ayan Banerjee,et al.  Generalized multiprotocol label switching: an overview of routing and management enhancements , 2001, IEEE Commun. Mag..

[507]  F. Diebold,et al.  Modeling Liquidity Risk with Implications for Traditional Market Risk Measurement and Management , 2008 .

[508]  A. Philpott.  Continuous-Time Shortest Path Problems and Linear Programming , 1994 .

[509]  Jerry R. Green,et al.  Partial Equilibrium Approach to the Free-Rider Problem , 1976 .

[510]  Robert Almgren,et al.  Optimal execution with nonlinear impact functions and trading-enhanced risk , 2003 .

[511]  Manuel Laguna,et al.  Tabu Search , 1997 .

[512]  Martin Skutella,et al.  Multicommodity flows over time: Efficient algorithms and complexity , 2003, Theor. Comput. Sci..

[513]  David Gale,et al.  Transient flows in networks. , 1959 .

[514]  Richard Cole,et al.  How much can taxes help selfish routing? , 2003, EC '03.

[515]  Laurence A. Wolsey,et al.  A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem , 2003, Networks.

[516]  Joan Feigenbaum,et al.  Hardness Results for Multicast Cost Sharing , 2002, FSTTCS.

[517]  D. Whittaker,et al.  A Course in Functional Analysis , 1991, The Mathematical Gazette.

[518]  Teresa León,et al.  A purification algorithm for semi-infinite programming , 1992 .

[519]  Martin P. W. Zerner.  A NON-BALLISTIC LAW OF LARGE NUMBERS FOR RANDOM WALKS IN I.I.D. RANDOM ENVIRONMENT , 2002 .

[520]  E.J. Friedman,et al.  Genericity and congestion control in selfish routing , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[521]  Linus Schrage,et al.  Letter to the Editor - A Proof of the Optimality of the Shortest Remaining Processing Time Discipline , 1968, Oper. Res..

[522]  L. Glosten,et al.  Market Microstructure: A Survey of Microfoundations, Empirical Results, and Policy Implications , 2005 .

[523]  James W. Walker.  From graphs to ortholattices and equivariant maps , 1983, J. Comb. Theory, Ser. B.

[524]  Joan Feigenbaum,et al.  Sharing the Cost of Multicast Transmissions , 2001, J. Comput. Syst. Sci..

[525]  Arthur Warburton,et al.  Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems , 1987, Oper. Res..

[526]  W.D. Grover,et al.  Modularity and economy-of-scale effects in the optimal design of mesh-restorable networks , 1999, Engineering Solutions for the Next Millennium. 1999 IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.99TH8411).

[527]  Leo G. Kroon,et al.  A Variable Trip Time Model for Cyclic Railway Timetabling , 2003, Transp. Sci..

[528]  Yossi Azar,et al.  The Price of Routing Unsplittable Flow , 2005, STOC '05.

[529]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[530]  Anthony Chen,et al.  A DYNAMIC TRAFFIC ASSIGNMENT MODEL WITH TRAFFIC-FLOW RELATIONSHIPS , 1995 .

[531]  Biswanath Mukherjee,et al.  Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study , 2000, TNET.

[532]  Daniel Bienstock,et al.  Strong inequalities for capacitated survivable network design problems , 2000, Math. Program..

[533]  Recursive sampling simulations of 3D gravity coupled to scalar fermions , 2000, hep-lat/0002015.

[534]  H. S. M. Coxeter,et al.  The abstract groups , 1939 .

[535]  Piet Demeester,et al.  Resilience in a multi-layer network , 1998 .

[536]  Achim Lamatsch,et al.  An Approach to Vehicle Scheduling with Depot Capacity Constraints , 1992 .

[537]  M. Zerner.  Directional decay of the Green's function for a random nonnegative potential on ${\bf Z}\sp d$ , 1998 .

[538]  Richard Cole,et al.  Pricing network edges for heterogeneous selfish users , 2003, STOC '03.

[539]  Maria Grazia Scutellà,et al.  Dynamic shortest paths minimizing travel times and costs , 2001, Networks.

[540]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[541]  Nina Amenta,et al.  Shadows and slices of polytopes , 1996, SCG '96.

[542]  Rudolf Müller,et al.  Decentralization and Mechanism Design for Online Machine Scheduling , 2006, SWAT.

[543]  E. Anderson.  A new continuous model for job-shop scheduling , 1981 .

[544]  W. Dorn.  Duality in Quadratic Programming... , 2011 .

[545]  Warren B. Powell,et al.  Stochastic and dynamic networks and routing , 1995 .

[546]  Ajay Subramanian,et al.  The Liquidity Discount , 2001 .

[547]  Mike Sexton,et al.  Broadband Networking: ATM, SDH, and SONET , 1997 .

[548]  A. D. Yahaya,et al.  iREX: inter-domain QoS automation using economics , 2006, CCNC 2006. 2006 3rd IEEE Consumer Communications and Networking Conference, 2006..

[549]  Jiirgen Bokowski.  A geometric realization without self-intersections does exist for Dyck's regular map , 1989, Discret. Comput. Geom..

[550]  Nikhil R. Devanur,et al.  Strategyproof cost-sharing mechanisms for set cover and facility location games , 2003, EC '03.

[551]  Chak-Kuen Wong,et al.  Time-varying minimum cost flow problems , 2001, Eur. J. Oper. Res..

[552]  Roger B. Myerson,et al.  Optimal Auction Design , 1981, Math. Oper. Res..

[553]  Mikkel Thorup,et al.  Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..

[554]  Anders Björner.  Essential chains and homotopy type of posets , 1992 .

[555]  Vardges Melkonian.  Flows in dynamic networks with aggregate arc capacities , 2007, Inf. Process. Lett..

[556]  Guido Schäfer,et al.  Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems , 2008, Theor. Comput. Sci..

[557]  B. Grünbaum.  On the facial structure of convex polytopes , 1965 .

[558]  Alexander Weiss,et al.  Executing large orders in a microscopic market model , 2009, 0904.4131.

[559]  Asuman E. Ozdaglar,et al.  Competition in Parallel-Serial Networks , 2007, IEEE Journal on Selected Areas in Communications.

[560]  E. Anderson.  Linear Programming In Infinite Dimensional Spaces , 1970 .

[561]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[562]  Dennis Huisman,et al.  Integrated and Dynamic Vehicle and Crew Scheduling , 1999 .

[563]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[564]  Matteo Fischetti,et al.  A Heuristic Algorithm for the Set Covering Problem , 1996, IPCO.

[565]  Michelle L. Wachs,et al.  Shellable nonpure complexes and posets. II , 1996 .

[566]  Eitan Altman,et al.  Competitive routing in networks with polynomial costs , 2002, IEEE Trans. Autom. Control..

[567]  P. Kreuzer,et al.  Optimal lines for railway systems , 1997 .

[568]  Laurent Goergen.  Limit velocity and zero--one laws for diffusions in random environment , 2006 .

[569]  Pradeep Dubey,et al.  Inefficiency of Nash Equilibria , 1986, Math. Oper. Res..

[570]  Edward A. Bender,et al.  The number of three-dimensional convex polyhedra , 1986 .

[571]  Y. Tauman,et al.  Optimal licensing of cost-reducing innovation , 1992 .

[572]  Avrim Blum,et al.  Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games , 2006, PODC '06.

[573]  Jonathan Eckstein,et al.  Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming , 2007, J. Heuristics.

[574]  Nicole Immorlica,et al.  Limitations of cross-monotonic cost sharing schemes , 2005, SODA '05.

[575]  H. Soner,et al.  Liquidity Models in Continuous and Discrete Time , 2010 .

[576]  Tim Roughgarden,et al.  Optimal Cost-Sharing Mechanisms for Steiner Forest Problems , 2006, WINE.

[577]  Alper Atamtürk,et al.  On capacitated network design cut–set polyhedra , 2002, Math. Program..

[578]  Manfred Völker,et al.  Recent Developments of HOT II , 1995 .

[579]  Matteo Fischetti,et al.  Solution of Large-Scale Railway Crew Planning Problems: the Italian Experience , 1999 .

[580]  Philip Protter,et al.  Liquidity Risk and Arbitrage Pricing Theory , 2004 .

[581]  Dietrich Braess,et al.  Über ein Paradoxon aus der Verkehrsplanung , 1968, Unternehmensforschung.

[582]  James B. Orlin.  A Faster Strongly Polynomial Minimum Cost Flow Algorithm , 1993, Oper. Res..

[583]  Knut Haase,et al.  An exact algorithm for the vehicle and crew scheduling problem , 1996 .

[584]  M. Pullan.  Forms of Optimal Solutions for Separated Continuous Linear Programs , 1995 .

[585]  Ariel Orda,et al.  On continuous network flows , 1995, Oper. Res. Lett..

[586]  Melvin Hochster,et al.  Rings of Invariants of Tori, Cohen-Macaulay Rings Generated by Monomials, and Polytopes , 1972 .

[587]  S. Smale,et al.  On the Structure of Manifolds , 1962 .

[588]  Nicholas R. Jennings,et al.  On the Impact of Strategy and Utility Structures on Congestion-Averse Games , 2009, WINE.

[589]  Bergfinnur Durhuus,et al.  Remarks on the entropy of 3-manifolds , 1995 .

[590]  Frank Cuypers.  Tools for Computational Finance , 2003 .

[591]  H. Moulin,et al.  Strategyproof sharing of submodular costs:budget balance versus efficiency , 2001 .

[592]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[593]  J. Ambjorn,et al.  The geometry of dynamical triangulations , 1996, hep-th/9612069.

[594]  Geir Dahl,et al.  A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems , 1998, INFORMS J. Comput..

[595]  A. Nabutovsky,et al.  Noncomputability arising in dynamical triangulation model of four-dimensional Quantum Gravity , 1992, hep-lat/9208014.

[596]  Peter McMullen,et al.  Equivelar polyhedral manifolds inE3 , 1982 .

[597]  Michael Hintermüller,et al.  A Proximal Bundle Method Based on Approximate Subgradients , 2001, Comput. Optim. Appl..

[598]  Jian-Qiang Hu,et al.  Traffic grooming, routing, and wavelength assignment in optical WDM mesh networks , 2004, IEEE INFOCOM 2004.

[599]  Antonio Capone,et al.  Design of Multi-Layer Networks with Traffic Grooming and Statistical Multiplexing , 2007 .

[600]  Dennis Huisman,et al.  Applying an Integrated Approach to Vehicle and Crew Scheduling in Practice , 2000 .

[601]  M. Freidlin.  Functional Integration And Partial Differential Equations , 1985 .

[602]  Timo Berthold,et al.  Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Improving the Feasibility Pump Improving the Feasibility Pump , 2022 .

[603]  Gabriel Y. Handler,et al.  A dual algorithm for the constrained shortest path problem , 1980, Networks.

[604]  R. Bellman.  Dynamic programming. , 1957, Science.

[605]  R. Lougee-Heimer,et al.  The Common Optimization INterface for Operations Research: Promoting open-source software in the operations research community , 2003 .

[606]  D. Weingarten.  Euclidean quantum gravity on a lattice , 1982 .

[607]  Malachy Carey,et al.  An approach to modelling time-varying flows on congested networks , 2000 .

[608]  D. R. J. Chillingworth,et al.  Collapsing three-dimensional convex polyhedra , 1967, Mathematical Proceedings of the Cambridge Philosophical Society.

[609]  A. Björner.  Topological methods , 1996 .

[610]  Masayuki Murata,et al.  Functional Partitioning for Multi-Layer Survivability in IP over WDM Networks , 2000 .

[611]  Andy Philpott,et al.  An adaptive discretization algorithm for a class of continuous network programs , 1995, Networks.

[612]  Joseph Naor,et al.  Equilibria in online games , 2007, SODA '07.

[613]  Frank H. Lutz,et al.  One-point suspensions and wreath products of polytopes and spheres , 2005, J. Comb. Theory, Ser. A.

[614]  Peter Bank,et al.  Hedging and Portfolio Optimization in Financial Markets with a Large Trader , 2004 .

[615]  Burkhard Monien,et al.  Fair cost-sharing methods for scheduling jobs on parallel machines , 2009, J. Discrete Algorithms.

[616]  Leo G. Kroon,et al.  Scheduling train drivers and guards: the Dutch "Noord-Oost" case , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[617]  J. Gärtner,et al.  Parabolic problems for the Anderson model , 1990 .

[618]  Rama Cont,et al.  The Price Impact of Order Book Events , 2010 .

[619]  O. Hudry.  R. L. Graham, M. Grötschel, L. Lovasz (sous la direction de), "Handbook of combinatorics", Amsterdam, North-Holland, 1995 (2 volumes) , 2000 .

[620]  Victor Klee,et al.  Which Spheres are Shellable , 1978 .

[621]  Stefano Leonardi,et al.  Cross-monotonic cost sharing methods for connected facility location games , 2004, Theor. Comput. Sci..

[622]  Anantaram Balakrishnan,et al.  Modeling and solving the single facility line restoration problem , 1998 .

[623]  Marco A. Duran,et al.  Logistics for world-wide crude oil transportation using discrete event simulation and optimal control , 2004, Comput. Chem. Eng..

[624]  Mohammad Mahdian,et al.  Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[625]  Martin Gairing,et al.  Price of Anarchy for Polynomial Wardrop Games , 2006, WINE.

[626]  Ravindra K. Ahuja,et al.  Network Flows , 2011 .

[627]  Makoto Imase,et al.  Dynamic Steiner Tree Problem , 1991, SIAM J. Discret. Math..

[628]  Malachy Carey,et al.  Optimal Time-Varying Flows on Congested Networks , 1987, Oper. Res..

[629]  Bin Ran,et al.  Dynamic Urban Transportation Network Models , 1994 .

[630]  Florian Schoppmann,et al.  The Power of Two Prices: Beyond Cross-Monotonicity , 2007, MFCS.

[631]  D. Hearn,et al.  Solving Congestion Toll Pricing Models , 1998 .

[632]  Ravindra K. Ahuja,et al.  A capacity scaling algorithm for the constrained maximum flow problem , 1995, Networks.

[633]  Gerhard J. Woeginger,et al.  Minimum-cost dynamic flows: The series-parallel case , 2004, Networks.

[634]  Yossi Azar,et al.  Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[635]  J. Desrosiers,et al.  A Primer in Column Generation , 2005 .

[636]  J. Goodman.  Note on Existence and Uniqueness of Equilibrium Points for Concave N-Person Games , 1965 .

[637]  Elias Koutsoupias,et al.  The price of anarchy of finite congestion games , 2005, STOC '05.

[638]  Matteo Fischetti,et al.  Modeling and Solving the Crew Rostering Problem , 1998, Oper. Res..

[639]  Dag Wedelin,et al.  An algorithm for large scale 0–1 integer programming with application to airline crew scheduling , 1995, Ann. Oper. Res..

[640]  L. V. Bogachev,et al.  Random Walks in Random Environments , 2007, 0707.3160.

[641]  Stefano Pallottino,et al.  Technical Note - Traffic Equilibrium Paradoxes , 1991, Transp. Sci..

[642]  Alan Kraus,et al.  PRICE IMPACTS OF BLOCK TRADING ON THE NEW YORK STOCK EXCHANGE , 1972 .

[643]  P. Dupuis,et al.  On Lipschitz continuity of the solution mapping to the Skorokhod problem , 1991 .

[644]  Wlodzimierz Szwarc.  The dynamic transportation problem , 1971 .

[645]  Hervé Rivano,et al.  Shared Risk Resource Group Complexity and Approximability Issues , 2007, Parallel Process. Lett..

[646]  Irina Dumitrescu,et al.  Constrained path and cycle problems , 2002 .

[647]  K. Cooke,et al.  The shortest route through a network with time-dependent internodal transit times , 1966 .

[648]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[649]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[650]  R. P. Jerrard,et al.  Collapsing a triangulation of a “knotted” cell , 1969 .

[651]  Timo Berthold.  Primal Heuristics for Mixed Integer Programs , 2006 .

[652]  Joan Feigenbaum,et al.  Approximation and collusion in multicast cost sharing , 2003, EC '03.

[653]  Donald Goldfarb,et al.  On the Complexity of the Simplex Method , 1994 .

[654]  E. Artin.  Zur Isotopie zweidimensionaler Flächen imR4 , 1925 .

[655]  Dynamical triangulations, a gateway to quantum gravity? , 1995, hep-th/9503108.

[656]  Mikkel Thorup,et al.  Increasing Internet Capacity Using Local Search , 2004, Comput. Optim. Appl..

[657]  Ömer Egecioglu,et al.  A Computationally Intractable Problem on Simplicial Complexes , 1996, Comput. Geom..

[658]  Avanidhar Subrahmanyam,et al.  Market Liquidity and Trading Activity , 2000 .

[659]  J. Gartner,et al.  Intermittency in a catalytic random medium , 2004, math/0406266.

[660]  Adrian Zymolka.  Design of Survivable Optical Networks by Mathematical Optimization , 2007 .

[661]  Kurt Mehlhorn,et al.  Resource Constrained Shortest Paths , 2000, ESA.

[662]  Hong Jin,et al.  Railroad Blocking: A Network Design Application , 2000, Oper. Res..

[663]  Éva Tardos,et al.  Group strategy proof mechanisms via primal-dual algorithms , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[664]  Joachim P. Walser.  Integer Optimization by Local Search , 2000, Lecture Notes in Computer Science.

[665]  Yasuhiro Yamai,et al.  Research Toward the Practical Application of Liquidity Risk Evaluation Methods , 2000 .

[666]  Robert W. Holthausen,et al.  Large-block transactions, the speed of response, and temporary and permanent stock-price effects , 1990 .

[667]  Yuri Kabanov,et al.  Hedging and liquidation under transaction costs in currency markets , 1999, Finance Stochastics.

[668]  B. Derrida,et al.  Classical Diffusion on a Random Chain , 1982 .

[669]  Radia Perlman,et al.  Interconnections: Bridges, Routers, Switches, and Internetworking Protocols , 1999 .

[670]  Oskar Bolza,et al.  Vorlesungen uber Variationsrechnung , 1961 .

[671]  Geir Dahl,et al.  Routing Through Virtual Paths in Layered Telecommunication Networks , 1999, Oper. Res..

[672]  R. Ellis,et al.  Entropy, large deviations, and statistical mechanics , 1985 .

[673]  Rolf H. Möhring,et al.  System-optimal Routing of Traffic Flows with User Constraints in Networks with Congestion System-optimal Routing of Traffic Flows with User Constraints in Networks with Congestion , 2022 .

[674]  David S. Johnson,et al.  `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.

[675]  Éva Tardos,et al.  “The quickest transshipment problem” , 1995, SODA '95.

[676]  J. Whitehead.  Simplicial Spaces, Nuclei and m‐Groups , 1939 .

[677]  Ioannis Patrikalakis,et al.  A New Decomposition Scheme of the Urban Public Transport Scheduling Problem , 1992 .

[678]  José A. Moreno-Pérez,et al.  Minimizing the cost of placing and sizing wavelength division multiplexing and optical crossconnect equipment in a telecommunications network , 2005 .

[679]  Pierre Patie,et al.  National Centre of Competence in Research Financial Valuation and Risk Management Working Paper No . 2 Risk Management for Derivatives in Illiquid Markets : A Simulation-Study , 2002 .

[680]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[681]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[682]  Gil Kalai,et al.  Rigidity and the lower bound theorem 1 , 1987 .

[683]  Chul-Young Byun.  Lower Bounds for Large-Scale Set Partitioning Problems , 2001 .

[684]  G. Ziegler,et al.  Decompositions of simplicial balls and spheres with knots consisting of few edges , 2000 .

[685]  D. Hearn,et al.  Congestion Toll Pricing of Traffic Networks , 1997 .

[686]  Alejandro F. Ram'irez,et al.  Asymptotic direction in random walks in random environment revisited , 2009, 0902.1115.

[687]  Screening Effect Due to Heavy Lower Tails in One-Dimensional Parabolic Anderson Model , 2000, math-ph/0007013.

[688]  Ralf Borndörfer,et al.  A Bundle Method for Integrated Multi-Depot Vehicle and Duty Scheduling in Public Transit , 2008 .

[689]  Entropy of random coverings and 4D quantum gravity , 1994, hep-th/9412097.

[690]  A. I. Mees,et al.  A FINITE-TIME ALGORITHM FOR SHORTEST PATH PROBLEMS WITH TIME-VARYING COSTS* , 1993 .

[691]  Tsong-Ho Wu,et al.  Emerging technologies for fiber network survivability , 1995, IEEE Commun. Mag..

[692]  A Quenched Invariance Principle for Certain Ballistic Random Walks in i.i.d. Environments , 2007, math/0702306.

[693]  Thomas Lewiner,et al.  Optimal discrete Morse functions for 2-manifolds , 2003, Comput. Geom..

[694]  G. E. Bredon.  Topology and geometry , 1993 .

[695]  Aranyak Mehta,et al.  Beyond Moulin mechanisms , 2009, Games Econ. Behav..

[696]  Chester Spatt,et al.  An Empirical Analysis of the Limit Order Book and the Order Flow in the Paris Bourse , 1995 .

[697]  Arun K. Somani,et al.  Request-specific routing in WDM grooming networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[698]  I. Milchtaich,et al.  Congestion Games with Player-Specific Payoff Functions , 1996 .

[699]  R. Bing.  An Alternative Proof that 3-Manifolds Can be Triangulated , 1959 .

[700]  E Tosini,et al.  AN INTERACTIVE SYSTEM FOR EXTRA-URBAN VEHICLE AND CREW SCHEDULING PROBLEMS , 1988 .

[701]  Ebrahim Nasrabadi,et al.  Minimum cost time-varying network flow problems , 2010, Optim. Methods Softw..

[702]  Malcolm Craig Pullan.  Convergence of a General Class of Algorithms for Separated Continuous Linear Programs , 2000, SIAM J. Optim..