A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool
From MaRDI portal
Publication:991821
DOI10.1007/s00291-007-0085-4zbMath1193.90236OpenAlexW2170207061WikidataQ58199776 ScholiaQ58199776MaRDI QIDQ991821
Publication date: 8 September 2010
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-007-0085-4
Applications of mathematical programming (90C90) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (2)
Construction of component tapes for radial placement machines ⋮ PCB assembly scheduling with alternative nozzle types for one component type
Cites Work
- Unnamed Item
- Unnamed Item
- Throughput rate optimization in the automated assembly of printed circuit boards
- The pickup and delivery problem with time windows
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
- Decomposition Principle for Linear Programs
- A Linear Programming Approach to the Cutting-Stock Problem
- A Class of Label-Correcting Methods for the K Shortest Paths Problem
- Routing with time windows by column generation
- A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
- Finding the k Shortest Paths
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- The General Pickup and Delivery Problem
- The symmetric generalized traveling salesman polytope
- Minimizing the number of pickups on a multi-head placement machine
- A Linear Programming Approach to the Cutting Stock Problem—Part II
This page was built for publication: A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool