Verzweigungsstrategien in branch and bound-algorithmen für gemischt-ganzzahlige lineare 0-1-optimierungsanfgaben (Q3832318): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/02331938908843474 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020618889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Programming by the Filter Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variablenfixierungen in gemischt-ganzzahligen linearen 0-1-Optimierungsaufgaben / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:59, 20 June 2024

scientific article
Language Label Description Also known as
English
Verzweigungsstrategien in branch and bound-algorithmen für gemischt-ganzzahlige lineare 0-1-optimierungsanfgaben
scientific article

    Statements

    Verzweigungsstrategien in branch and bound-algorithmen für gemischt-ganzzahlige lineare 0-1-optimierungsanfgaben (English)
    0 references
    0 references
    1989
    0 references
    pseudo-solutions
    0 references
    surrogate constraint
    0 references
    branching strategies
    0 references
    branch and bound
    0 references
    mixed Boolean programs
    0 references
    linear relaxation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references