- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1573-2916
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Rigorous packing of unit squares into a circle ; day:3 ; month:10 ; year:2018 ; pages:1-19
Journal of global optimization ; (3.10.2018), 1-19
- Urheber
-
Montanher, Tiago
- Beteiligte Personen und Organisationen
- DOI
-
10.1007/s10898-018-0711-5
- URN
-
urn:nbn:de:101:1-2018111300524784847396
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:45 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Montanher, Tiago
- Neumaier, Arnold
- Csaba Markót, Mihály
- Domes, Ferenc
- Schichl, Hermann
- SpringerLink (Online service)
Ähnliche Objekte (12)
TRANSLATIVE PACKING TWO SQUARES IN THE UNIT SQUARE
Improved interval methods for solving circle packing problems in the unit square
Parallel Packing Squares into a Triangle
A polynomial algorithm for packing unit squares in a hypograph of a piecewise linear function
Translative Packing of Unit Squares Into Equilateral Triangles Some New Results On Information Transmission Over Noisy Channels
Guillotine cutting is asymptotically optimal for packing consecutive squares
Translative covering by unit squares
Packing squares into a rectangle with a relatively small area
Perfectly Packing a Square by Squares of Nearly Harmonic Sidelength
Packing of non-blocking cubes into the unit cube
Online packing of d-dimensional boxes into the unit cube
Flows with Unit Path Capacities and Related Packing and Covering Problems
TRANSLATIVE PACKING TWO SQUARES IN THE UNIT SQUARE
Improved interval methods for solving circle packing problems in the unit square
Parallel Packing Squares into a Triangle
A polynomial algorithm for packing unit squares in a hypograph of a piecewise linear function
Translative Packing of Unit Squares Into Equilateral Triangles Some New Results On Information Transmission Over Noisy Channels
Guillotine cutting is asymptotically optimal for packing consecutive squares
Translative covering by unit squares
Packing squares into a rectangle with a relatively small area
Perfectly Packing a Square by Squares of Nearly Harmonic Sidelength
Packing of non-blocking cubes into the unit cube
Online packing of d-dimensional boxes into the unit cube
Flows with Unit Path Capacities and Related Packing and Covering Problems
TRANSLATIVE PACKING TWO SQUARES IN THE UNIT SQUARE
Improved interval methods for solving circle packing problems in the unit square
Parallel Packing Squares into a Triangle
A polynomial algorithm for packing unit squares in a hypograph of a piecewise linear function
Translative Packing of Unit Squares Into Equilateral Triangles Some New Results On Information Transmission Over Noisy Channels
Guillotine cutting is asymptotically optimal for packing consecutive squares
Translative covering by unit squares
Packing squares into a rectangle with a relatively small area
Perfectly Packing a Square by Squares of Nearly Harmonic Sidelength
Packing of non-blocking cubes into the unit cube
Online packing of d-dimensional boxes into the unit cube