Monge properties, discrete convexity and applications
From MaRDI portal
Publication:2432877
DOI10.1016/J.EJOR.2005.04.050zbMATH Open1137.90579OpenAlexW2023878014MaRDI QIDQ2432877FDOQ2432877
Recommendations
Cites work
- scientific article; zbMATH DE number 432782 (Why is no real title available?)
- scientific article; zbMATH DE number 3904328 (Why is no real title available?)
- scientific article; zbMATH DE number 4027206 (Why is no real title available?)
- scientific article; zbMATH DE number 3630467 (Why is no real title available?)
- scientific article; zbMATH DE number 1263283 (Why is no real title available?)
- scientific article; zbMATH DE number 3272833 (Why is no real title available?)
- A CHARACTERIZATION OF THE MONGE PROPERTY AND ITS CONNECTION TO STATISTICS
- A Monge property for the \(d\)-dimensional transportation problem
- A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs
- A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time
- An Algorithm for Submodular Functions on Graphs
- An Inequality for Probabilities
- An algorithm for the detection and construction of Monge sequences
- An introduction to copulas. Properties and applications
- Boole-Bonferroni Inequalities and Linear Programming
- Bounds on the probability of the union and intersection of m events
- Discrete Convex Analysis
- Efficiently solvable special cases of bottleneck travelling salesman problems
- Extreme Hamiltonian lines
- Geometric applications of a matrix-searching algorithm
- Inequalities for distributions with given marginals
- Inequalities on expectations based on the knowledge of multivariate moments
- Mass transportation problems. Vol. 1: Theory. Vol. 2: Applications
- Monge sequences, antimatroids, and the transportation problem with forbidden arcs
- Most Stringent Bounds on Aggregated Probabilities of Partially Specified Dependent Probability Systems
- On the recognition of permuted bottleneck Monge matrices
- On the role of bottleneck Monge matrices in combinatorial optimization
- Perspectives of Monge properties in optimization
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Sharp Bounds on Probabilities Using Linear Programming
- The use of discrete moment bounds in probabilistic constrained stochastic programming models
- Three-dimensional axial assignment problems with decomposable cost coefficients
Cited in
(18)- Resequencing a set of strings based on a target string
- A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
- Cooperative assignment games with the inverse Monge property
- Bounded-length Smith-Waterman alignment
- Structure and dimension of the eigenspace of a concave Monge matrix
- Estimation of Monge matrices
- Four-point conditions for the TSP: the complete complexity classification
- Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs
- Sequence Alignment Algorithms for Run-Length-Encoded Strings
- Inventory allocation with full downward substitution and monotone cost differences
- Allocation under a general substitution structure
- scientific article; zbMATH DE number 2154257 (Why is no real title available?)
- Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon
- Properties of the \(d\)-dimensional Earth mover's problem
- On the weak convergence of Monge-Ampère measures for discrete convex mesh functions
- Monge properties, optimal greedy policies, and policy improvement for the dynamic stochastic transportation problem
- The assignment problem with nearly Monge arrays and incompatible partner indices
- Traditional inventory models for better price competitiveness
This page was built for publication: Monge properties, discrete convexity and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2432877)
