Heuristics and their design: A survey
From MaRDI portal
Publication:1152854
DOI10.1016/0377-2217(81)90024-2zbMath0461.90081OpenAlexW1974362268MaRDI QIDQ1152854
Publication date: 1981
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(81)90024-2
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Mathematical programming (90C99)
Related Items
A heuristic for multiple choice programming, Project selection with discounted returns and multiple constraints, Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics, Heuristic methods and applications: A categorized survey, Bewertung heuristischer Methoden, A decision-theoretic framework for comparing heuristics
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- The assignment-to-days problems in a school time-table, a heuristic approach
- An adaptive branching rule for the permutation flow-shop problem
- Contributions to the quadratic assignment problem
- Solution of the zero-one multiple knapsack problem
- Complexity of spanning tree problems: Part I
- Remarks on the requirement matrix of school timetable problems and regular embeddings of graphs
- A method and two algorithms on the theory of partitions
- Optimization+objectivity=opt out
- A network solution to a general vehicle scheduling problem
- A unified formulation of the machine scheduling problem
- Branching from the largest upper bound. Folklore and facts
- An optimal procedure for the single-model deterministic assembly line balancing problem
- An algorithm and efficient data structures for the binary knapsack problem
- Considerations on the requirements matrix of a non-regular school time- table problem
- Assignment Problems and the Location of Economic Activities
- An Automatic Method of Solving Discrete Programming Problems
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- Heuristic analysis, linear programming and branch and bound
- Optimization problems arising from the incorporation of split values in search trees
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
- Hard Knapsack Problems
- Approximate Traveling Salesman Algorithms
- A Heuristic Approach to Quadratic Assignment Problem
- Worst-Case Analysis of Heuristic Algorithms
- An Algorithm for Large Zero-One Knapsack Problems
- Computer programming as an art
- Heuristische Lösungsverfahren für Lieferplanprobleme
- Heuristische Verfahren zur Maschinenbelegungsplanung bei Reihenfertigung
- Heuristische Lösungsverfahren Versuch einer Begriffsklärung
- Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme
- Set Partitioning: A survey
- Heuristische Verfahren zur Lösung allgemeiner ganzzahliger linearer Optimierungsprobleme (Ein überblick)
- Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems
- Reporting computational experiments in mathematical programming
- Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
- The Vehicle Scheduling Problem and Monte Carlo Simulation
- Heuristic for the Hamiltonian Path Problem in Euclidian Two Space
- A Heuristic Branch-and-Bound Algorithm for Telephone Feeder Capacity Expansion
- Computer Solutions of the Traveling Salesman Problem
- Branch-and-Bound Methods: A Survey
- A tree-search algorithm for mixed integer programming problems
- An Algorithm for the Traveling Salesman Problem
- Discrete Optimizing
- Probability of Survival as an Investment Criterion
- A Branch Search Algorithm for the Knapsack Problem
- Branch-and-Bound Methods: General Formulation and Properties
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II
- The Efficiency of Computer Algorithms for Plant Layout
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
