Monge matrices make maximization manageable (Q1890948): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q170010
Import recommendations run Q6767936
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Gerhard J. Woeginger / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / 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: Special cases of travelling salesman problems and heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5557602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: an ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / 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: Extreme Hamiltonian lines / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0167-6377(94)90037-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2120283278 / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: A matrix generalization of a vector maximization problem / rank
 
Normal rank
Property / Recommended article: A matrix generalization of a vector maximization problem / qualifier
 
Similarity Score: 0.8520091
Amount0.8520091
Unit1
Property / Recommended article: A matrix generalization of a vector maximization problem / qualifier
 
Property / Recommended article
 
Property / Recommended article: Computing an eigenvector of a Monge matrix in max-plus algebra / rank
 
Normal rank
Property / Recommended article: Computing an eigenvector of a Monge matrix in max-plus algebra / qualifier
 
Similarity Score: 0.85049313
Amount0.85049313
Unit1
Property / Recommended article: Computing an eigenvector of a Monge matrix in max-plus algebra / qualifier
 
Property / Recommended article
 
Property / Recommended article: On the matrix Monge–Kantorovich problem / rank
 
Normal rank
Property / Recommended article: On the matrix Monge–Kantorovich problem / qualifier
 
Similarity Score: 0.8424163
Amount0.8424163
Unit1
Property / Recommended article: On the matrix Monge–Kantorovich problem / qualifier
 
Property / Recommended article
 
Property / Recommended article: On maximum principles for monotone matrices / rank
 
Normal rank
Property / Recommended article: On maximum principles for monotone matrices / qualifier
 
Similarity Score: 0.8406212
Amount0.8406212
Unit1
Property / Recommended article: On maximum principles for monotone matrices / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3028741 / rank
 
Normal rank
Property / Recommended article: Q3028741 / qualifier
 
Similarity Score: 0.83812076
Amount0.83812076
Unit1
Property / Recommended article: Q3028741 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Computing an eigenvector of an inverse Monge matrix in max-plus algebra / rank
 
Normal rank
Property / Recommended article: Computing an eigenvector of an inverse Monge matrix in max-plus algebra / qualifier
 
Similarity Score: 0.8365079
Amount0.8365079
Unit1
Property / Recommended article: Computing an eigenvector of an inverse Monge matrix in max-plus algebra / qualifier
 
Property / Recommended article
 
Property / Recommended article: The Maximum Matrix Contraction Problem / rank
 
Normal rank
Property / Recommended article: The Maximum Matrix Contraction Problem / qualifier
 
Similarity Score: 0.83382237
Amount0.83382237
Unit1
Property / Recommended article: The Maximum Matrix Contraction Problem / qualifier
 
Property / Recommended article
 
Property / Recommended article: Optimal solutions of the Monge problem / rank
 
Normal rank
Property / Recommended article: Optimal solutions of the Monge problem / qualifier
 
Similarity Score: 0.8303405
Amount0.8303405
Unit1
Property / Recommended article: Optimal solutions of the Monge problem / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q2715511 / rank
 
Normal rank
Property / Recommended article: Q2715511 / qualifier
 
Similarity Score: 0.82955635
Amount0.82955635
Unit1
Property / Recommended article: Q2715511 / qualifier
 
Property / Recommended article
 
Property / Recommended article: A Matrix Maximum / rank
 
Normal rank
Property / Recommended article: A Matrix Maximum / qualifier
 
Similarity Score: 0.829267
Amount0.829267
Unit1
Property / Recommended article: A Matrix Maximum / qualifier
 

Latest revision as of 21:19, 4 April 2025

scientific article
Language Label Description Also known as
English
Monge matrices make maximization manageable
scientific article

    Statements

    Monge matrices make maximization manageable (English)
    0 references
    0 references
    0 references
    0 references
    28 May 1995
    0 references
    Monge property
    0 references
    Monge matrix
    0 references
    distribution matrix
    0 references
    balanced cut
    0 references
    \(k\)- matching
    0 references
    Monge structures
    0 references
    longest paths in bipartite, edge-weighted graphs
    0 references

    Identifiers