Column enumeration based decomposition techniques for a class of non-convex MINLP problems (Q1029695): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(9 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-007-9271-9 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: BARON / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LGO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: VerGO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LINDO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LINGO / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-007-9271-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069491280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\alpha BB\): A global optimization method for general constrained nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated container loading software for pulp and paper industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing different-sized circles into a rectangular container / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithms for packing unequal circles into a rectangular container / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting circles and polygons from area-minimizing rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3879251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization. From theory to implementation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-reduce approach to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: BARON: A general purpose global optimization software package / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical model and a solution method for the problem of placing various-sized circles into a strip / rank
 
Normal rank
Property / cites work
 
Property / cites work: A technical review of column generation in integer programming / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-007-9271-9 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:52, 10 December 2024

scientific article
Language Label Description Also known as
English
Column enumeration based decomposition techniques for a class of non-convex MINLP problems
scientific article

    Statements

    Column enumeration based decomposition techniques for a class of non-convex MINLP problems (English)
    0 references
    0 references
    0 references
    0 references
    13 July 2009
    0 references
    MINLP
    0 references
    column enumeration
    0 references
    decomposition
    0 references
    packing
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers