On multi-index assignment polytopes (Q2494661): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.laa.2005.11.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979989080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of facets for the Latin square polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the orthogonal Latin squares polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time separation algorithms for the three-index assignment polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the three-index assignment polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Three-Index Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Assignment Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for multi-dimensional assignment problems with decomposable costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145800 / 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: On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5752285 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Latin squares and the facial structure of related polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-tables, polyhedra and the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bilinear programming formulation of the 3-dimensional assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of a 3-dimensional assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Methods in Mathematical Programming—The Solid Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the planar three-index assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—The Multidimensional Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tracking elementary particles near their primary vertex: A combinatorial approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for multi-index transportation problems with decomposable costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy transportation-like problems on K-dimensional arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4801573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for the existence of solutions of the three-dimensional planar transportation problem / rank
 
Normal rank

Latest revision as of 17:11, 24 June 2024

scientific article
Language Label Description Also known as
English
On multi-index assignment polytopes
scientific article

    Statements

    On multi-index assignment polytopes (English)
    0 references
    0 references
    20 July 2006
    0 references
    polyhedral combinatorics
    0 references
    multi-index assignment
    0 references
    polytope
    0 references
    facet
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers