Rainer E. Burkard, Bettina Klinz, Rüdiger Rudolf  Home/Search
Context Related
| tugraz.ac.at/pub/papers/m...sfb2.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: fmatbhp1.tugraz.ac.at/~rudo...sp (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: An m × n matrix C is called Monge matrix if c ij + c rs c is + c rj for all 1 i ! r m, 1 j ! s n. In this paper we present a survey on Monge matrices and related Monge properties and their role in combinatorial optimization. Specifically, we deal with the following three main topics: (i) fundamental combinatorial properties of Monge structures, (ii) applications of Monge properties to optimization problems and (iii) recognition of Monge properties. (Update)
Cited by: More
Expansive Motions and the Polytope of Pointed.. - Rote, Santos, Streinu (2001) (Correct)
Traveling salesman games with the Monge property - Okamoto (2004) (Correct)
Active bibliography (related documents): More All
3.9: Well-Solvable Special Cases of the TSP: A Survey - Burkard, Deineko, van Dal.. (1995) (Correct)
1.8: Weak Algebraic Monge Arrays - Rudolf, Fortin (1995) (Correct)
1.6: Efficiently Solvable Special Cases of Hard Combinatorial.. - Burkard (1997) (Correct)
Similar documents based on text: More All
1.6: On the Recognition of Permuted Supnick and Incomplete.. - Deineko, Rudolf.. (1994) (Correct)
1.5: The Cone of Monge Matrices: Extremal Rays and Applications - Rudolf, Woeginger (1994) (Correct)
1.3: The Travelling Salesman Problem on Permuted Monge Matrices - Burkard, Deineko, Woeginger (1995) (Correct)
Related documents from co-citation: More All
10: the reconstruction of specially structured matrices (context) - Deineko, Filonenko - 1979
9: Well-solved special cases (context) - Gilmore, Lawler et al.
8: vertex traveling salesman problem that can be solved in O (context) - Park, case et al. - 1991
BibTeX entry: (Update)
R.E. Burkard, B. Klinz and R. Rudolf, Perspectives of Monge Properties in Optimization, to appear in Discrete Applied Mathematics. http://citeseer.ist.psu.edu/71816.html More
@article{ burkard96perspectives,
author = "Burkard and Klinz and Rudolf",
title = "Perspectives of Monge Properties in Optimization",
journal = "DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science",
volume = "70",
year = "1996",
url = "citeseer.ist.psu.edu/71816.html" }
Citations (may not include all citations):488 Algorithmic Graph Theory and Perfect Graphs (context) - Golumbic - 1980
373 Cambridge University Press (context) - Hardy, Littlewood et al. - 1952
68 Probability Metrics and the Stability of Stochastic Models (context) - Rachev - 1991
57 Geometric applications of a matrixsearching algorithm (context) - Aggarwal, Klawe et al. - 1987
56 Optimal two- and three-stage production schedules with setup.. (context) - Johnson - 1954
55 Stanford University Press (context) - Karlin, positivity - 1968
48 Linear approximation of shortest superstrings - Blum, Jiang et al. - 1991
38 Linear Programming in Infinite-Dimensional Spaces: Theory an.. (context) - Anderson, Nash - 1987
34 A faster strongly polynomial minimum cost flow algorithm (context) - Orlin - 1988
32 Notes on searching in multidimensional monotone arrays (context) - Aggarwal, Park - 1988
31 Springer-Verlag (context) - Korte, Lov'asz et al. - 1991
29 Minimizing a submodular function on a lattice (context) - Topkis - 1978
28 Dynamic version of the economic lot size model (context) - Wagner, Whitin - 1958
24 Efficient parallel algorithms for string editing and related.. (context) - Apostolico, Atallah et al. - 1990
22 The concave least-weight subsequence problem revisited (context) - Wilber - 1988
20 On simple linear programming problems (context) - Hoffman - 1963
20 Sequence comparison with mixed convex and concave costs (context) - Eppstein - 1990
19 Speed-up in dynamic programming (context) - Yao - 1982
19 The least weight subsequence problem (context) - Hirschberg, Larmore - 1987
19 An optimal algorithm for finding minimal enclosing triangles (context) - O'Rourke, Aggarwal et al. - 1986
18 Bipartite permutation graphs (context) - Spinrad, Brandstadt et al. - 1987
18 An almost linear time algorithm for generalized matrix searc.. (context) - Klawe, Kleitman - 1990
16 The Monge-Kantorovich mass transference problem and its stoc.. (context) - Rachev - 1984
16 Efficient dynamic programming using quadrangle inequalities (context) - Yao - 1980
15 the reconstruction of specially structured matrices (context) - Deineko, Filonenko - 1979
15 Two special cases of the assignment problem (context) - Karp, Li - 1975
15 A linear-time algorithm for concave one-dimensional dynamic .. (context) - Galil, Park - 1990
14 Perfect elimination and chordal bipartite graphs (context) - Golumbic, Goss - 1978
14 Fast matching algorithms for points on a polygon (context) - Marcotte, Suri - 1991
13 Extreme hamiltonian lines (context) - Supnick - 1957
12 Send-and-split method for minimum-concave-cost network flows (context) - Erickson, Monma et al. - 1987
11 Improved algorithms for economic lot-size problems (context) - Aggarwal, Park - 1993
11 line dynamic programming with applications to the prediction.. (context) - Larmore, Schieber - 1991
11 vertex traveling salesman problem that can be solved in O (context) - Park, case et al. - 1991
11 Edgeconvex circuits and the traveling salesman problem (context) - Kalmanson - 1975
10 M'emoire sur la th'eorie des d'eblais et des remblais (context) - Monge
10 A simple forward algorithm to solve general dynamic lot sizi.. (context) - Federgruen, Tzur - 1991
10 time minimum-cost matching algorithms for quasiconvex tours (context) - Buss, Yianilos et al. - 1994
10 Finding a minimum weight K-link path in graphs with Monge pr.. (context) - Aggarwal, Schieber et al. - 1994
9 Approximating shortest superstrings - Teng, Yao - 1993
8 Improved selection in totally monotone arrays (context) - Mansour, Park et al. - 1993
8 Optimierung und Kontrolle (context) - Burkard, Deineko et al. - 1995
8 Optimierung und Kontrolle (context) - Burkard, ela et al. - 1995
8 Efficient minimum cost matching using quadrangle inequality (context) - Aggarwal, Bar-Noy et al. - 1992
8 Computing a minimum-weight k-link path in graphs with the co.. (context) - Schieber - 1995
7 Special cases of travelling salesman problems and heuristics (context) - Burkard - 1990
7 algorithm that runs in linear time in the Wagner-Whitin case (context) - Wagelmans, van Hoesel et al. - 1992
6 A special case of travelling salesman problems (context) - Demidenko - 1976
6 Permuting matrices to avoid forbidden submatrices (context) - Klinz, Rudolf et al. - 1995
6 Optimierung und Kontrolle (context) - Deineko, Rudolf et al. - 1994
6 Rapid dynamic programming algorithms for RNA secondary struc.. (context) - Waterman, Smith - 1986
6 Optimierung und Kontrolle (context) - Rudolf, Woeginger et al. - 1994
6 Optimierung und Kontrolle (context) - Deineko, Rudolf et al. - 1995
6 American Mathematical Monthly (context) - Lorentz, for - 1953
5 A general class of greedily solvable linear programs (context) - Queyranne, Spieksma et al. - 1993
5 Monge matrices make maximization manageable - Pferschy, Rudolf et al. - 1994
5 Monge sequences and a simple assignment algorithm (context) - Derigs, Goecke et al. - 1986
5 a problem of Monge (context) - Kantorovich - 1948
5 Well-solvable special cases of the TSP: A survey - Burkard, Deineko et al. - 1995
5 Parallel searching in multidimensional monotone arrays (context) - Aggarwal, Park - 1989
5 An algorithm for the detection and construction of Monge seq.. (context) - Alon, Cosares et al. - 1989
5 Minimum cost flow algorithms for series-parallel networks (context) - Bein, Brucker et al. - 1985
5 Inequalities for distributions with given marginals (context) - Tchen - 1980
4 the Monge property of matrices (context) - Cechl'arov'a, Szab'o - 1990
4 Characterization and algorithms for greedily solvable transp.. (context) - Shamir, Dietrich - 1990
4 Personal communication (context) - Woeginger - 1994
4 Extending the quadrangle inequality to speed-up dynamic prog.. (context) - Borchers, Gupta - 1994
4 Generalization of the results of Gilmore and Gomory on the s.. (context) - Burdyuk, Trofimov - 1976
4 Polynomially solvable cases of the traveling salesman proble.. (context) - Burkard, Deineko - 1995
4 to appear in Mathematical Programming (context) - Faigle, Kern et al. - 1993
4 Discrete Applied Mathematics (context) - Rudolf, d-dimensional et al. - 1994
4 Efficiently solvable special cases of bottleneck travelling .. (context) - Burkard, Sandholzer - 1991
3 Zeitschrift fur Wahrscheinlichkeitstheorie und verwandte Geb.. (context) - Cambanis, Simons et al. - 1976
3 The quadratic assignment problem: special cases and relative.. (context) - ela - 1995
3 Efficient parallel algorithms for bipartite permutation grap.. (context) - Chen, Yesha - 1993
3 Applying dynamic programming to solving a special multi-trav.. (context) - Deineko - 1979
3 a class of polynomially solvable travelling salesman problem.. (context) - Michalski - 1987
3 dimensional transportation problem (context) - Bein, Brucker et al. - 1995
3 Solvable cases of the traveling salesman problem with variou.. (context) - van der Veen - 1992
3 Weakly admissible transformations for solving algebraic assi.. (context) - Burkard, Zimmermann - 1980
3 Universal conditions for algebraic travelling salesman probl.. (context) - Burkard, van der Veen - 1991
2 Solution of some transportation problems with relaxed or add.. (context) - Rachev, Ruschendorf - 1994
2 A structure theorem for the consecutive ones property (context) - Tucker - 1972
2 the transfer of masses (context) - Kantorovich - 1942
2 presented at the 3rd Twente Workshop on Graphs and Combinato.. (context) - Bein, Brucker et al. - 1993
2 bottleneck transportation problems (context) - Varadarajan, algorithm et al. - 1991
2 On quadratic choice problems (context) - Sarvanov - 1978
2 On greedy algorithms that succeed (context) - Hoffman - 1985
2 A minimum concave-cost dynamic network flow problem with an .. (context) - Graves, Orlin - 1985
2 On transportation problems with upper bounds on leading rect.. (context) - Barnes, Hoffman - 1985
2 bottleneck transportation problem (context) - Szwarc, solution et al. - 1993
2 Sur les tableaux de corr'elation dont les marges sont donn'e.. (context) - Frech'et - 1957
2 Sur les tableaux de corr'elation dont les marges sont donn'e.. (context) - Frech'et - 1951
2 Some recent results in the analysis of greedy algorithms for.. (context) - Faigle - 1994
2 antimatroids and the transportation problem with forbidden a.. (context) - Dietrich, sequences - 1990
2 Sequential searching in multidimensional monotone arrays (context) - Aggarwal, Park - 1989
2 Remarks on some scheduling problems with algebraic objective.. (context) - Burkard - 1978
2 Easy and hard cases of the quadratic assignment problem: a s.. (context) - Burkard, ela et al. - 1995
2 translated from Avtomatika i Telemekhanika (context) - Rubinshtein, symmetric et al. - 1971
2 A deterministic multi-period production scheduling model wit.. (context) - Zangwill - 1966
2 Algorithms for finding extremum of a linear form on the set .. (context) - Aizenshtat, Kravchuk - 1968
2 Gaussian elimination and matchings in bipartite graphs (context) - Derigs, Goecke et al. - 1984
2 A fast algorithm for constructing Monge sequences in transpo.. (context) - Shamir - 1993
1 Otto-von-Guericke Universitat Magdeburg (context) - Girlich, Kovalev et al. - 1994
1 algorithm to solve the bottleneck traveling salesman problem.. (context) - van der Veen - 1993
1 Chapter 4 in The Traveling Salesman Problem (context) - Gilmore, Lawler et al. - 1985
1 Program in Operations Research (context) - Veinott, Unpublished - 1963
1 Perspectives of Monge Properties in Optimization (context) - Gaikov, minimization et al. - 1980
1 Monge properties and their recognition (context) - Rudolf - 1993
1 More applications of Monge-array techniques to economic lot-.. (context) - Aggarwal, Park - 1993
1 On Monge sequences in d-dimensional arrays - Rudolf - 1993
1 Staircase transportation problems with superadditive rewards.. (context) - Hoffman, Veinott - 1993
1 Optimierung und Kontrolle (context) - und, Rudolf et al. - 1995
1 On greedy algorithms for series parallel graphs (context) - Hoffman - 1988
1 A characterization of the Monge property (context) - Bein, Pathak - 1990
1 Reshipments and overshipments in transportation problems wit.. (context) - Eiselt, Burkard - 1991
1 Department of Applied Mathematics and Statistics (context) - Balinski, Rachev et al. - 1989
1 Series parallel composition of greedy linear programming pro.. (context) - Bein, Brucker et al. - 1993
1 Gamma-free matrices (context) - Spinrad, in - 1995
1 A general Hungarian method for the algebraic transportation .. (context) - Burkard - 1978
1 Selection in monotone matrices and kth nearest neighbors (context) - Agarwal, Sen - 1994
1 the role of bottleneck Monge matrices in combinatorial optim.. (context) - Burkard - 1995
1 Schriften des Mathematischen Instituts und des Instituts fur.. (context) - Hoeffding, Korrelationstheorie - 1940
1 A concise survey of efficiently solvable special cases of th.. (context) - Monma, Kan - 1983
1 Distributions with given marginals subject to certain constr.. (context) - Olkin, Rachev - 1990
1 Mass transportation problems with capacity constraints (context) - Olkin, Rachev - 1991
1 Greedily solvable transportation networks and edge-guided ve.. (context) - Adler, Shamir - 1993
1 Monge and feasibility sequences in general flow problems (context) - Adler, Hoffman et al. - 1993
1 Chapter 8 in Handbooks in OR & MS (context) - Gusfield, with et al. - 1992
1 Axial assignment problems with decomposable cost coefficient.. (context) - Burkard, Rudolf et al. - 1992
1 The Monge array: An abstraction and its applications (context) - Park - 1991
1 Selection and sorting in totally monotone matrices (context) - Kravets, Park - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fmatbhp1.tu-graz.ac.at/~rudolf/sp.htm): More
On Monge Sequences in d-Dimensional Arrays - Rudolf (1993) (Correct)
Spanning Trees and Shortest Paths in Monge Graphs - Dudás, Rudolf (1996) (Correct)
Computational Investigations on 3-dimensional Axial.. - Burkard, Rudolf (1992) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC