A hybrid approach to discrete mathematical programming (Q4170534): Difference between revisions

From MaRDI portal
Added link to MaRDI 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: Merging and Sorting Applied to the Zero-One Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined use of dynamic programming and branch-and-bound methods in discrete-programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-Route Methods: 1. Reaching, Pruning, and Buckets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4102520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual algorithm for the one-machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Algorithms: A Framework and State-of-the-Art Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Linear Integer Programming Formulations of Nonlinear Integer Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Heuristic Procedures for Integer Linear Programming with an Interior / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Dominance Relations in Branch-and-Bound Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: When the Greedy Solution Solves a Class of Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4136936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The imbedded state approach to reducing dimensionality in dynamic programs of higher dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Nonlinear Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Bound Strategies for Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized permanent label setting algorithm for the shortest path between specified nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Dynamic Programming and Capital Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The knapsack problem: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems / rank
 
Normal rank

Latest revision as of 00:27, 13 June 2024

scientific article; zbMATH DE number 3604681
Language Label Description Also known as
English
A hybrid approach to discrete mathematical programming
scientific article; zbMATH DE number 3604681

    Statements

    A hybrid approach to discrete mathematical programming (English)
    0 references
    0 references
    0 references
    0 references
    1978
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references