Three perspectives for solving the job grouping problem (Q4443354): 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.1080/00207540110072984 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2153593632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grouping PCB<sub>s</sub>for set-up reduction: a maximum spanning tree approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint satisfaction problems: Algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grouping components in printed circuit board assembly with limited component staging capacity and single card setup: Problem characteristics and solution procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the <i>k</i>-Clique Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency in networks of relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254883 / rank
 
Normal rank

Latest revision as of 12:45, 6 June 2024

scientific article; zbMATH DE number 2024782
Language Label Description Also known as
English
Three perspectives for solving the job grouping problem
scientific article; zbMATH DE number 2024782

    Statements

    Identifiers