A strong cutting plane algorithm for the robotic assembly line balancing problem (Q4399053): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
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/00207549508904817 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1983533679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assembly-Line Balancing by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem / rank
 
Normal rank

Latest revision as of 12:25, 28 May 2024

scientific article; zbMATH DE number 1179738
Language Label Description Also known as
English
A strong cutting plane algorithm for the robotic assembly line balancing problem
scientific article; zbMATH DE number 1179738

    Statements

    Identifiers