"Formulation of packing problem applying densest packing algorithms to ..."

Hiromu Onda (2012)

> Home

Details and statistics

DOI: 10.1109/IECON.2012.6389149

access: closed

type: Conference or Workshop Paper

metadata version: 2020-10-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/iecon/Onda12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iecon/Onda12
Hiromu Onda:
Formulation of packing problem applying densest packing algorithms to planning of packing for robot. IECON 2012: 2705-2712

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.