scientific article; zbMATH DE number 3272833
From MaRDI portal
Publication:5557602
zbMath0171.17801MaRDI QIDQ5557602
Publication date: 1963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Recognition of \(d\)-dimensional Monge arrays, Optimal solutions in the multi-location inventory system with transshipments, Approximating shortest superstrings with constraints, Monge matrices make maximization manageable, On Transportation Problems with Upper Bounds on Leading Rectangles, Permuting matrices to avoid forbidden submatrices, On the recognition of permuted bottleneck Monge matrices, On the role of bottleneck Monge matrices in combinatorial optimization, Optimal couplings are totally positive and more, Limit laws for empirical optimal solutions in random linear programs, Inequalities of Rayleigh quotients and bounds on the spectral radius of nonnegative symmetric matrices, On Monge sequences in \(d\)-dimensional arrays, Submodular linear programs on forests, Perspectives of Monge properties in optimization, 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, Optimal rates for estimation of two-dimensional totally positive distributions, On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices, Inventory allocation with full downward substitution and monotone cost differences, Monge properties of sequence alignment, Monge properties, discrete convexity and applications, Estimation of Monge matrices, Monge sequences, antimatroids, and the transportation problem with forbidden arcs, Minimizing the number of tardy job units under release time constraints, Sparse Monge matrices arising from scheduling problems, A greedy algorithm for solving ordinary transportation problem with capacity constraints, A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time, Allocation under a general substitution structure, Easy capacitated facility location problems, with connections to lot-sizing, Dynamic programming with convexity, concavity and sparsity, A pricing problem under Monge property, Note on pseudolattices, lattices and submodular linear programs, Reformulating linear programs with transportation constraints-With applications to workforce scheduling, Monge and feasibility sequences in general flow problems, Discrete optimization: an Austrian view, Some of my favorite integer programming applications at IBM, Selected topics on assignment problems, Randomized priority algorithms, Equilibrated anti-Monge matrices, The Northwest corner rule revisited, Approximating shortest superstrings with constraints, Cooperative assignment games with the inverse Monge property, A Monge property for the \(d\)-dimensional transportation problem, A general model for matroids and the greedy algorithm, A fast bipartite network flow algorithm for selective assembly, Properties of the \(d\)-dimensional Earth mover's problem, A generalization for the expected value of the earth mover's distance, Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem, Weak Monge arrays in higher dimensions, Unnamed Item, An instant solution of the \(2\times n\) bottleneck transportation problem, Series parallel composition of greedy linear programming problem, Staircase transportation problems with superadditive rewards and cumulative capacities
