A learn‐and‐construct framework for general mixed‐integer programming problems (Q6066679): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q129460414, #quickstatements; #temporary_batch_1726323884171
 
(3 intermediate revisions by 3 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1111/itor.12578 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2884674635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the feasibility pump / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A feasibility pump heuristic for general mixed-integer problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting the feasibility pump / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to the Feasibility Pump in Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring relaxation induced neighborhoods to improve MIP solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3783827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The feasibility pump / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility pump 2.0 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-based automatic neighborhood design by unsupervised learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: ParamILS: An Automatic Algorithm Configuration Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129460414 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:46, 14 September 2024

scientific article; zbMATH DE number 7766413
Language Label Description Also known as
English
A learn‐and‐construct framework for general mixed‐integer programming problems
scientific article; zbMATH DE number 7766413

    Statements

    A learn‐and‐construct framework for general mixed‐integer programming problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 November 2023
    0 references
    mixed integer programming
    0 references
    heuristics
    0 references
    feasible solution
    0 references
    unsupervised learning
    0 references
    optimization
    0 references

    Identifiers