New convergent heuristics for 0-1 mixed integer programming (Q2378374): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2008.01.044 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2147414046 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of very large-scale neighborhood search techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical Cuts on the Unit Hypercube / 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: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multidimensional 0-1 knapsack problem: an overview. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multidimensional 0-1 knapsack problem -- bounds and computational aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved convergent heuristics for the 0-1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting nested inequalities and surrogate constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search and local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bringing order into the neighborhoods: Relaxation guided variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-one programming with many variables and few constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved results on the 0--1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3437243 / rank
 
Normal rank

Latest revision as of 22:24, 28 June 2024

scientific article
Language Label Description Also known as
English
New convergent heuristics for 0-1 mixed integer programming
scientific article

    Statements

    New convergent heuristics for 0-1 mixed integer programming (English)
    0 references
    0 references
    0 references
    8 January 2009
    0 references
    relaxation
    0 references
    0-1 mixed integer programming
    0 references
    heuristic
    0 references
    multidimensional knapsack problem
    0 references
    0 references
    0 references

    Identifiers