scientific article; zbMATH DE number 3272833

Cited in

(58)

A general model for matroids and the greedy algorithm
A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time
Dynamic programming with convexity, concavity and sparsity
A fast bipartite network flow algorithm for selective assembly
An instant solution of the 2 n bottleneck transportation problem
Series parallel composition of greedy linear programming problem
Staircase transportation problems with superadditive rewards and cumulative capacities
Recognition of \(d\)-dimensional Monge arrays
Approximating shortest superstrings with constraints
Inequalities of Rayleigh quotients and bounds on the spectral radius of nonnegative symmetric matrices
On Monge sequences in \(d\)-dimensional arrays
Weak Monge arrays in higher dimensions
A greedy algorithm for solving ordinary transportation problem with capacity constraints
Allocation under a general substitution structure
A Monge property for the \(d\)-dimensional transportation problem
Monge matrices make maximization manageable
Permuting matrices to avoid forbidden submatrices
On the recognition of permuted bottleneck Monge matrices
On the role of bottleneck Monge matrices in combinatorial optimization
Submodular linear programs on forests
Perspectives of Monge properties in optimization
Easy capacitated facility location problems, with connections to lot-sizing
A generalization for the expected value of the earth mover's distance
Limit laws for empirical optimal solutions in random linear programs
Optimal rates for estimation of two-dimensional totally positive distributions
Estimation of Monge matrices
The Northwest corner rule revisited
Properties of the \(d\)-dimensional Earth mover's problem
Optimal solutions in the multi-location inventory system with transshipments
Monge properties, discrete convexity and applications
Sparse Monge matrices arising from scheduling problems
On Transportation Problems with Upper Bounds on Leading Rectangles
Monge properties of sequence alignment
Reformulating linear programs with transportation constraints-With applications to workforce scheduling
Optimal couplings are totally positive and more
Monge properties, optimal greedy policies, and policy improvement for the dynamic stochastic transportation problem
Approximating shortest superstrings with constraints
Discrete optimization: an Austrian view
Some of my favorite integer programming applications at IBM
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
Equilibrated anti-Monge matrices
The sum of all width-one matrices
Comparing weighted difference and Earth mover's distance via Young diagrams
Independence versus indetermination: basis of two canonical clustering criteria
Inventory allocation with full downward substitution and monotone cost differences
On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices
Monge and feasibility sequences in general flow problems
The Demazure product extended to biwords
Complexity of computing the worst optimal value of interval transportation problems
Selected topics on assignment problems
Expected value and a Cayley-Menger-type formula for the generalized earth mover's distance
Identifiability and exact reconstruction of the optimal transport cost on finite spaces
Cooperative assignment games with the inverse Monge property
Monge sequences, antimatroids, and the transportation problem with forbidden arcs
Minimizing the number of tardy job units under release time constraints
A pricing problem under Monge property
Note on pseudolattices, lattices and submodular linear programs
Randomized priority algorithms

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5557602)