Complexity results for the horizontal bar packing problem (Q975490): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2008.07.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976682037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing convex polyominoes from horizontal and vertical projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: An acyclic days-off scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tiling with bars under tomographic constraints. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete tomography. Foundations, algorithms, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving problems of discrete tomography application in workforce scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of domino tiling from its two orthogonal projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Properties of Matrices of Zeros and Ones / rank
 
Normal rank

Latest revision as of 21:25, 2 July 2024

scientific article
Language Label Description Also known as
English
Complexity results for the horizontal bar packing problem
scientific article

    Statements

    Identifiers