A trust branching path heuristic for zero-one programming (Q1014935): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/j.ejor.2008.06.033 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069385500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the multidimensional knapsack problem / 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: Q4817244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization and multi knapsack: a percolation algorithm. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3570242 / 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: Computational aspects of a branch and bound algorithm for quadratic zero- one programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 / rank
 
Normal rank

Latest revision as of 13:17, 1 July 2024

scientific article
Language Label Description Also known as
English
A trust branching path heuristic for zero-one programming
scientific article

    Statements

    A trust branching path heuristic for zero-one programming (English)
    0 references
    30 April 2009
    0 references
    0 references
    branch and bound
    0 references
    heuristics
    0 references
    multiknapsack
    0 references
    clique
    0 references
    0 references
    0 references
    0 references