Monge sequences and a simple assignment algorithm
From MaRDI portal
Publication:1104243
DOI10.1016/0166-218X(86)90045-4zbMATH Open0646.90068MaRDI QIDQ1104243FDOQ1104243
Oskar Goecke, Rainer Schrader, Ulrich Derigs
Publication date: 1986
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
- On Monge sequences in \(d\)-dimensional arrays
- An algorithm for the detection and construction of Monge sequences
- A simple algorithm for the constrained sequence problems
- Computing the sequence of \(k\)-cardinality assignments
- On monochromatic linear recurrence sequences
- scientific article; zbMATH DE number 3919846
- Berkowitz's algorithm and clow sequences
- On the number of monotone sequences
- On monotonicity of some combinatorial sequences
- A sequences analog of the Piatetski-Shapiro problem
Numerical mathematical programming methods (65K05) Linear programming (90C05) Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)
Cites Work
Cited In (10)
- Monge sequences, antimatroids, and the transportation problem with forbidden arcs
- Submodular linear programs on forests
- The nucleon of cooperative games and an algorithm for matching games
- Selected topics on assignment problems
- On Monge sequences in \(d\)-dimensional arrays
- Some recent results in the analysis of greedy algorithms for assignment problems
- On Assignment Problems Related to Gromov–Wasserstein Distances on the Real Line
- On the Monge property of matrices
- Perspectives of Monge properties in optimization
- Weak Monge arrays in higher dimensions
Uses Software
This page was built for publication: Monge sequences and a simple assignment algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104243)
