Perspectives of Monge properties in optimization (Q1923588): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Monge and feasibility sequences in general flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric applications of a matrix-searching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel searching in generalized Monge arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms for Economic Lot Size Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selection in monotone matrices and computing k th nearest neighbors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5559545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3205013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the detection and construction of Monge sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3770273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Parallel Algorithms for String Editing and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Transportation Problems with Upper Bounds on Leading Rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Series parallel composition of greedy linear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Monge property for the \(d\)-dimensional transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost flow algorithms for series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A CHARACTERIZATION OF THE MONGE PROPERTY AND ITS CONNECTION TO STATISTICS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending the quadrangle inequality to speed-up dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4191842 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general Hungarian method for the algebraic transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3754426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special cases of travelling salesman problems and heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the role of bottleneck Monge matrices in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The travelling salesman problem on permuted Monge matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-dimensional axial assignment problems with decomposable cost coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiently solvable special cases of bottleneck travelling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal conditions for algebraic travelling salesman problems to be efficiently solvable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly admissible transformations for solving algebraic assignment and transportation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4335196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities for E k(X, Y) when the marginals are fixed / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Monge property of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms for bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three easy special cases of the euclidean travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the recognition of permuted Supnick and incomplete Monge matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sometimes travelling is easy: The master tour problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monge sequences and a simple assignment algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monge sequences, antimatroids, and the transportation problem with forbidden arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reshipments and overshipments in transportation problems with minimax objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence comparison with mixed convex and concave costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Send-and-Split Method for Minimum-Concave-Cost Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some recent results in the analysis of greedy algorithms for assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular linear programs on forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5810228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3265202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for concave one-dimensional dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Elimination and Chordal Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimum concave-cost dynamic network flow problem with an application to lot-sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5812325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Least Weight Subsequence Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5557602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3737235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On greedy algorithms for series parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Staircase transportation problems with superadditive rewards and cumulative capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edgeconvex Circuits and the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two special cases of the assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Almost Linear Time Algorithm for Generalized Matrix Searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permuting matrices to avoid forbidden submatrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the recognition of permuted bottleneck Monge matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selection and sorting in totally monotone arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line dynamic programming with applications to the prediction of RNA secondary structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Inequality for Rearrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: IMPROVED SELECTION IN TOTALLY MONOTONE ARRAYS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Matching Algorithms for Points on a Polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5753758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A concise survey of efficiently solvable special cases of the permutation flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mass transportation problems with capacity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for finding minimal enclosing triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monge matrices make maximization manageable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Monge–Kantorovich Mass Transference Problem and Its Stochastic Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mass transhipment problems and ideal metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of Some Transportation Problems with Relaxed or Additional Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the symmetric traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of \(d\)-dimensional Monge arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Monge sequences in \(d\)-dimensional arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cone of Monge matrices: Extremal rays and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4170156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonredundant 1’s in $\Gamma $-Free Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme Hamiltonian lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: An instant solution of the \(2\times n\) bottleneck transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities for distributions with given marginals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing a Submodular Function on a Lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structure theorem for the consecutive 1's property / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Version of the Economic Lot Size Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapid dynamic programming algorithms for RNA secondary structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: The concave least-weight subsequence problem revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speed-Up in Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Deterministic Multi-Period Production Scheduling Model with Backlogging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear and combinatorial optimization in ordered algebraic structures / rank
 
Normal rank

Revision as of 14:05, 24 May 2024

scientific article
Language Label Description Also known as
English
Perspectives of Monge properties in optimization
scientific article

    Statements

    Perspectives of Monge properties in optimization (English)
    0 references
    0 references
    0 references
    0 references
    9 October 1996
    0 references
    recognition problems
    0 references
    Monge matrix
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers