A benchmark library and a comparison of heuristic methods for the linear ordering problem
暂无分享,去创建一个
[1] Nicolas de Condorcet. Essai Sur L'Application de L'Analyse a la Probabilite Des Decisions Rendues a la Pluralite Des Voix , 2009 .
[2] Andrew Lim,et al. Designing A Hybrid Genetic Algorithm for the Linear Ordering Problem , 2003, GECCO.
[3] Hollis B. Chenery,et al. International Comparisons of the Structure of Production , 1958 .
[4] Celso C. Ribeiro,et al. A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs , 2002, INFORMS J. Comput..
[5] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.
[6] Henri Aujac,et al. La hiérarchie des industries dans un tableau des échanges interindustriels , 1960 .
[7] Fred W. Glover,et al. Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..
[8] Stefan Chanas,et al. A new heuristic algorithm solving the linear ordering problem , 1996, Comput. Optim. Appl..
[9] Fred W. Glover,et al. An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem , 2001, J. Glob. Optim..
[10] T. Klastorin,et al. Optimal Weighted Ancestry Relationships , 1974 .
[11] Michael Jünger,et al. Journal of Graph Algorithms and Applications 2-layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms , 2022 .
[12] Irène Charon,et al. A survey on the linear ordering problem for weighted or unweighted tournaments , 2007, 4OR.
[13] Gerhard Reinelt,et al. The Linear Ordering Problem: Exact and Heuristic Methods in Combinatorial Optimization , 2011 .
[14] Rafael Martí,et al. Variable neighborhood search for the linear ordering problem , 2006, Comput. Oper. Res..
[15] Gerhard Reinelt,et al. A Cutting Plane Algorithm for the Linear Ordering Problem , 1984, Oper. Res..
[16] Reiner Horst,et al. A new simplicial cover technique in constrained global optimization , 1992, J. Glob. Optim..
[17] Hans Frenk,et al. High performance optimization , 2000 .
[18] J. Craggs. Applied Mathematical Sciences , 1973 .
[19] Konrad Boenchendorf. Reihenfolgeprobleme = Mean-flow-time sequencing , 1982 .
[20] F. Glover,et al. Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.
[21] W. Leontief. Quantitative Input and Output Relations in the Economic Systems of the United States , 1936 .
[22] Donald E. Knuth,et al. The Stanford GraphBase - a platform for combinatorial computing , 1993 .
[23] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[24] P. McMullen. THE LINEAR ORDERING PROBLEM: ALGORITHMS AND APPLICATIONS (Research and Exposition in Mathematics 8) , 1987 .
[25] G. Reinelt,et al. Combinatorial optimization and small polytopes , 1996 .
[26] Mauricio G. C. Resende,et al. Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..
[27] Rafael Martí,et al. Scatter Search: Diseño Básico y Estrategias avanzadas , 2002, Inteligencia Artif..
[28] Thomas Stützle,et al. The linear ordering problem: Instances, search space analysis and algorithms , 2004, J. Math. Model. Algorithms.
[29] Gerhard Reinelt,et al. The linear ordering problem: algorithms and applications , 1985 .
[30] Michel X. Goemans,et al. The Strongest Facets of the Acyclic Subgraph Polytope Are Unknown , 1996, IPCO.
[31] Rafael Martí,et al. Intensification and diversification with elite tabu search solutions for the linear ordering problem , 1999, Comput. Oper. Res..