Heuristics and their design: A survey (Q1152854): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimization+objectivity=opt out / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4174530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5523467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Scheduling Problem and Monte Carlo Simulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of spanning tree problems: Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5532885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reporting computational experiments in mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree-search algorithm for mixed integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149405 / 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: Remarks on the requirement matrix of school timetable problems and regular embeddings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of Heuristic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching from the largest upper bound. Folklore and facts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Branch-and-Bound Algorithm for Telephone Feeder Capacity Expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristische Verfahren zur Lösung allgemeiner ganzzahliger linearer Optimierungsprobleme (Ein überblick) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Traveling Salesman Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch Search Algorithm for the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability of Survival as an Investment Criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer programming as an art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems and the Location of Economic Activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3212918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Automatic Method of Solving Discrete Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified formulation of the machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Approach to Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4062939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Bound Methods: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristische Verfahren zur Maschinenbelegungsplanung bei Reihenfertigung / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network solution to a general vehicle scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the zero-one multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristische Lösungsverfahren für Lieferplanprobleme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4162691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Bound Methods: General Formulation and Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5560711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5604994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4062932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method and two algorithms on the theory of partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic for the Hamiltonian Path Problem in Euclidian Two Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3902950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The assignment-to-days problems in a school time-table, a heuristic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Considerations on the requirements matrix of a non-regular school time- table problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive branching rule for the permutation flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization problems arising from the incorporation of split values in search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Optimizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Efficiency of Computer Algorithms for Plant Layout / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristische Lösungsverfahren Versuch einer Begriffsklärung / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm and efficient data structures for the binary knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal procedure for the single-model deterministic assembly line balancing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5510384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic analysis, linear programming and branch and bound / rank
 
Normal rank

Latest revision as of 11:21, 13 June 2024

scientific article
Language Label Description Also known as
English
Heuristics and their design: A survey
scientific article

    Statements

    Heuristics and their design: A survey (English)
    0 references
    1981
    0 references
    Bibliography
    0 references
    heuristics
    0 references
    survey
    0 references
    synopsis of combinatorial problems
    0 references
    design of heuristics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers