Heuristics and their design: A survey
type: Item
instance of: scholarly article
title: Heuristics and their design: A survey
zbMATH Open document ID: 0461.90081
DOI: 10.1016/0377-2217(81)90024-2
author: Heiner Müller-Merbach
published in: European Journal of Operational Research
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C99
Mathematics Subject Classification ID: 90-02
zbMATH DE Number: 3722451
zbMATH Keywords: Bibliography
zbMATH Keywords: heuristics
zbMATH Keywords: survey
zbMATH Keywords: synopsis of combinatorial problems
zbMATH Keywords: design of heuristics
MaRDI profile type: Publication
full work available at URL: 0377-2217(81)90024-2
OpenAlex ID: W1974362268
cites work: Optimization+objectivity=opt out
cites work: Set Partitioning: A survey
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: Q4174530
cites work: Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme
cites work: Q5523467
cites work: The Vehicle Scheduling Problem and Monte Carlo Simulation
cites work: Complexity of spanning tree problems: Part I
cites work: Q4083324
cites work: Contributions to the quadratic assignment problem
cites work: Q5532885
cites work: Hard Knapsack Problems
cites work: Q4138187
cites work: Reporting computational experiments in mathematical programming
cites work: Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
cites work: A tree-search algorithm for mixed integer programming problems
cites work: Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems
cites work: Q4149405
cites work: Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
cites work: Remarks on the requirement matrix of school timetable problems and regular embeddings of graphs
cites work: Q3851950
cites work: Worst-Case Analysis of Heuristic Algorithms
cites work: Branching from the largest upper bound. Folklore and facts
cites work: A Heuristic Branch-and-Bound Algorithm for Telephone Feeder Capacity Expansion
cites work: Heuristische Verfahren zur Lösung allgemeiner ganzzahliger linearer Optimierungsprobleme (Ein überblick)
cites work: Approximate Traveling Salesman Algorithms
cites work: A Branch Search Algorithm for the Knapsack Problem
cites work: Probability of Survival as an Investment Criterion
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: Q4142699
cites work: Computer programming as an art
cites work: Assignment Problems and the Location of Economic Activities
cites work: Q3212918
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: Q5519709
cites work: An Automatic Method of Solving Discrete Programming Problems
cites work: A unified formulation of the machine scheduling problem
cites work: A Heuristic Approach to Quadratic Assignment Problem
cites work: Q4130999
cites work: Q4062939
cites work: Branch-and-Bound Methods: A Survey
cites work: Heuristische Verfahren zur Maschinenbelegungsplanung bei Reihenfertigung
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: An Algorithm for the Traveling Salesman Problem
cites work: New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
cites work: A network solution to a general vehicle scheduling problem
cites work: Solution of the zero-one multiple knapsack problem
cites work: Heuristische Lösungsverfahren für Lieferplanprobleme
cites work: Q4162691
cites work: Branch-and-Bound Methods: General Formulation and Properties
cites work: Q5560711
cites work: Q5585875
cites work: Q5604994
cites work: Q5576130
cites work: Q4062932
cites work: A method and two algorithms on the theory of partitions
cites work: Heuristic for the Hamiltonian Path Problem in Euclidian Two Space
cites work: Q3902950
cites work: The assignment-to-days problems in a school time-table, a heuristic approach

Heuristics and their design: A survey (cites work)
cites work: Considerations on the requirements matrix of a non-regular school time- table problem

Heuristics and their design: A survey (cites work)
cites work: An adaptive branching rule for the permutation flow-shop problem

Heuristics and their design: A survey (cites work)
cites work: Optimization problems arising from the incorporation of split values in search trees

Heuristics and their design: A survey (cites work)
cites work: Q4144192

Heuristics and their design: A survey (cites work)
cites work: Discrete Optimizing

Heuristics and their design: A survey (cites work)
cites work: The Efficiency of Computer Algorithms for Plant Layout

Heuristics and their design: A survey (cites work)
cites work: Heuristische Lösungsverfahren Versuch einer Begriffsklärung

Heuristics and their design: A survey (cites work)
cites work: An algorithm and efficient data structures for the binary knapsack problem

Heuristics and their design: A survey (cites work)
cites work: An optimal procedure for the single-model deterministic assembly line balancing problem

Heuristics and their design: A survey (cites work)
cites work: Q5510384

Heuristics and their design: A survey (cites work)
cites work: Q4124606

Heuristics and their design: A survey (cites work)
cites work: Heuristic analysis, linear programming and branch and bound