A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm (Q1919838): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>N</i>-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing algorithm for the minimum weighted perfect euclidean matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of algorithms for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4184789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated Annealing – An Annotated Bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: General Purpose Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Set-Partitioning Problem: Set Covering with Equality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Airline Crew Scheduling Problems by Branch-and-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Penalty computations for the set partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated clustering problems by hybrid simulated annealing and tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785827 / rank
 
Normal rank

Latest revision as of 13:43, 24 May 2024

scientific article
Language Label Description Also known as
English
A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm
scientific article

    Statements

    A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 September 1996
    0 references
    0 references
    simulated annealing
    0 references
    set partitioning
    0 references