A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool
type: Item
instance of: scholarly article
title: A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool
zbMATH Open document ID: 1193.90236
author: Dong-Seok Sun
author: Tae-Eog Lee
published in: OR Spectrum
publication date: 2010-09-08T00:00:00Z
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5780963
zbMATH Keywords: component placement tool
zbMATH Keywords: placement routing
zbMATH Keywords: column generation
zbMATH Keywords: branch-and-price algorithm
Wikidata QID: Q58199776
MaRDI profile type: Publication
full work available at URL: s00291-007-0085-4
OpenAlex ID: W2170207061
cites work: Throughput rate optimization in the automated assembly of printed circuit boards
cites work: Decomposition Principle for Linear Programs
cites work: Routing with time windows by column generation
cites work: The pickup and delivery problem with time windows
cites work: Finding the k Shortest Paths
cites work: An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
cites work: The symmetric generalized traveling salesman polytope
cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II
cites work: A Class of Label-Correcting Methods for the K Shortest Paths Problem
cites work: Q5578578
cites work: Minimizing the number of pickups on a multi-head placement machine
cites work: Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
cites work: Q4520807
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
cites work: The General Pickup and Delivery Problem
cites work: A Branch-and-Price Algorithm for the Generalized Assignment Problem
cites work: On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
DOI: 10.1007/S00291-007-0085-4
description: scientific article; zbMATH DE number 5780963