Algorithms for some graph theoretical optimization problems

This is a summary of the main results presented in the author’s PhD thesis. This thesis, written in English, was supervised by Frits Spieksma and defended on September 23, 2005 at the Katholieke Universiteit Leuven. A copy of the thesis is available from the authors website (http://www.econ. kuleuven.be/linda.moonen/public/). The thesis can be roughly split into two parts. The first part is dedicated to the problem of partitioning partially ordered sets into chains of limited size. The second part deals with the structure and the connectivity of the Internet.

[1]  A. Gaeremynck.  The use of depreciation in accounting as a signalling device , 1995 .

[2]  Lixin Gao,et al.  On inferring autonomous system relationships in the Internet , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[3]  Deborah Estrin,et al.  The impact of routing policy on Internet paths , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[4]  Christophe Mues.  On the use of decision tables and diagrams in knowledge modelling and verification , 2002 .

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

[6]  Roger Wattenhofer,et al.  The impact of Internet policy and topology on delayed routing convergence , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[7]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[8]  Egon Wanke,et al.  k-NLC Graphs and Polynomial Algorithms , 1994, Discret. Appl. Math..

[9]  Laurence A. Wolsey,et al.  An exact algorithm for IP column generation , 1994, Oper. Res. Lett..

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

[11]  Renata Teixeira,et al.  General Terms Measurement , 2022 .

[12]  G. Nemhauser,et al.  Integer Programming , 2020 .

[13]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[14]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[15]  Gonzales d'Alcantara,et al.  SERENA : a macroeconomic sectoral regional and national accounting econometric model for the Belgian economy , 1983 .

[16]  Vadim V. Lozin,et al.  On the linear structure and clique-width of bipartite permutation graphs , 2003, Ars Comb..

[17]  Inge Geyskens,et al.  Trust, Satisfaction, and Equity in Marketing Channel Relationships , 1998 .

[18]  Karolien De Bruyne.  Essays in the location of economic activity , 2004 .

[19]  Martina Vandebroek,et al.  Two-stage designs robust to model uncertainty , 2003 .

[20]  Bing Zhou,et al.  Bounded vertex coloring of trees , 2001, Discret. Math..

[21]  Thomas Erlebach,et al.  On the Spectrum and Structure of Internet Topology Graphs , 2002, IICS.

[22]  Gerd Finke,et al.  Batch processing with interval graph compatibilities between tasks , 2005, Discret. Appl. Math..

[23]  Stefan Felsner,et al.  Maximum k-chains in planar point sets , 1992 .

[24]  Kangbok Lee,et al.  Continuous slab caster scheduling and interval graphs , 2004 .

[25]  Abilio Lucena,et al.  Branch and cut algorithms , 1996 .

[26]  W. Trotter,et al.  Combinatorics and Partially Ordered Sets: Dimension Theory , 1992 .

[27]  Feodor F. Dragan,et al.  New Graph Classes of Bounded Clique-Width , 2002, Theory of Computing Systems.

[28]  Dirk Hoorelbeke.  Bootstrap and Pivoting Techniques for Testing Multiple Hypotheses , 2005 .

[29]  Giuseppe Di Battista,et al.  Algorithms for the Inference of the Commercial Relationships between Autonomous Systems: Results Analysis and Model Validation , 2004 .

[30]  Walter Willinger,et al.  Towards capturing representative AS-level Internet topologies , 2004, Comput. Networks.

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

[32]  Libor Krkoška.  Industrial Restructuring in Central and Eastern Europe , 2001 .

[33]  Pierre Hansen,et al.  Bounded vertex colorings of graphs , 1990, Discret. Math..

[34]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[35]  Maing-Kyu Kang,et al.  A fast algorithm for two-dimensional pallet loading problems of large size , 2001, Eur. J. Oper. Res..

[36]  Leslie E. Trotter,et al.  Branch, Cut, and Price: Sequential and Parallel , 2000, Computational Combinatorial Optimization.

[37]  Joan Feigenbaum,et al.  A BGP-based mechanism for lowest-cost routing , 2002, PODC '02.

[38]  Frits C. R. Spieksma,et al.  Exact Algorithms for a Loading Problem with Bounded Clique Width , 2006, INFORMS J. Comput..

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

[40]  Guido De Bruyne.  Coordination of economic policy: A game-theoretic approach , 1980 .

[41]  Reinaldo Morabito,et al.  A simple and effective recursive procedure for the manufacturer's pallet loading problem , 1998, J. Oper. Res. Soc..

[42]  G. Di Battista,et al.  Computing the types of the relationships between autonomous systems , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[43]  Martina Vandebroek,et al.  An adjustment algorithm for optimal run orders in design of experiments , 2002 .

[44]  Faculteit Economische En,et al.  SOLUTION CONCEPTS AND OUTSIDER BEHAVIOUR IN COALITION FORMATION GAMES , 2003 .

[45]  Lixin Gao,et al.  The extent of AS path inflation by routing policies , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

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

[47]  Patrick Van Cayseele.  Regulation and international innovative activities in the pharmaceutical industry , 1987 .

[48]  R. P. Dilworth,et al.  A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS , 1950 .

[49]  Eric V. Denardo,et al.  Dynamic Programming: Models and Applications , 2003 .

[50]  Barbara Deleersnyder.  Marketing in turbulent times. , 2003 .

[51]  E. A. Silver,et al.  An overview of heuristic solution methods , 2004, J. Oper. Res. Soc..

[52]  Egon Wanke,et al.  How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time , 2001, WG.

[53]  Eberhard E. Bischoff.  Stability aspects of pallet loading , 1991 .

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

[55]  Klaus Jansen,et al.  The mutual exclusion scheduling problem for permutation and comparability graphs , 1998, Inf. Comput..

[56]  Guntram Scheithauer,et al.  The G4-Heuristic for the Pallet Loading Problem , 1996 .

[57]  Harald Dyckhoff,et al.  A typology of cutting and packing problems , 1990 .

[58]  Stefan Felsner,et al.  Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms , 1998, SIAM J. Comput..

[59]  Roel Leus,et al.  The generation of stable project plans , 2004, 4OR.

[60]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[61]  Frank Harary,et al.  Graph Theory , 2016 .

[62]  Adam N. Letchford,et al.  Analysis of upper bounds for the Pallet Loading Problem , 2001, Eur. J. Oper. Res..

[63]  Martin Desrochers,et al.  A Breakthrough in Airline Crew Scheduling , 1991 .

[64]  Sanjeev Khanna,et al.  A PTAS for the multiple knapsack problem , 2000, SODA '00.

[65]  Ramesh Govindan,et al.  Internet path inflation due to policy routing , 2001, SPIE ITCom.

[66]  Viggo Kann,et al.  Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete , 1991, Inf. Process. Lett..

[67]  Thomas Erlebach,et al.  Classifying customer-provider relationships in the internet , 2002 .

[68]  Gerardus Sierksma,et al.  Linear and integer programming - theory and practice , 1999, Pure and applied mathematics.

[69]  O. Ore.  Theory of Graphs , 1962 .

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

[71]  Nancy Huyghebaert,et al.  The capital structure of business start-ups , 2000 .

[72]  Guntram Scheithauer,et al.  A Heuristic Approach for Solving the Multi-Pallet Packing Problem , 1996 .

[73]  Dirk Van den Poel.  Response modeling for database marketing using binary classification , 1999 .

[74]  Srinivasan Seshan,et al.  Scaling properties of the Internet graph , 2003, PODC '03.

[75]  Klaus Jansen,et al.  On the Complexity of Scheduling Incompatible Jobs with Unit-Times , 1993, MFCS.

[76]  Randy H. Katz,et al.  Characterizing the Internet hierarchy from multiple vantage points , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[78]  Hongsuda Tangmunarunkit,et al.  Internet Topology : Discovery and Policy Impact , 2003 .

[79]  Edward G. Coffman,et al.  Mutual Exclusion Scheduling , 1996, Theor. Comput. Sci..

[80]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[81]  Leslie E. Trotter,et al.  Cardinality-restricted Chains and Antichains in Partially ordered Sets , 1996, Discret. Appl. Math..

[82]  Anees Shaikh,et al.  A measurement-based analysis of multihoming , 2003, SIGCOMM '03.

[83]  Geert Dhaene.  Encompassing: Formulation, Properties and Testing , 1997 .

[84]  Walter Willinger,et al.  What Causal Forces Shape Internet Connectivity at the AS-level? , 2003 .

[85]  Frederic Vermeulen.  Essays on the collective approach to household labour supply , 2002 .

[86]  Bernard M. E. Moret.  Theory of computation , 1978, Inf. Process. Manag..

[87]  Ratul Mahajan,et al.  Colt ? ? ? ? ? ? ◦ DTAG ? ◦ • ◦ ? ? ? ? ! ◦ ? ? ? ◦ ◦ ? ? Eqip ? ? ? ? ? ? , 2003 .

[88]  Chʿang-chʿi Wu,et al.  Strategic Aspects of Oligopolistic Vertical Integration , 1992 .

[89]  Thomas Erlebach,et al.  Cuts and Disjoint Paths in the Valley-Free Path Model , 2004, Internet Math..

[90]  Martin Ceyssens.  On the peak load problem in the presence of rationing by waiting , 1979 .

[91]  Mourad Boudhar,et al.  Scheduling a batch processing machine with bipartite compatibility graphs , 2003, Math. Methods Oper. Res..

[92]  Jan Riehme,et al.  An efficient approach for the multi-pallet loading problem , 2000, Eur. J. Oper. Res..

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

[94]  Bruno Courcelle,et al.  Handle-Rewriting Hypergraph Grammars , 1993, J. Comput. Syst. Sci..

[95]  Lixin Gao,et al.  On the evaluation of AS relationship inferences [Internet reachability/traffic flow applications] , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[96]  Bruno Courcelle,et al.  Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..

[97]  A. D. Schepper.  Stochastic interest rates and the probabilistic behaviour of actuarial functions , 1996 .