Solution of Integer Linear Programming Problems by Direct Search

DOI10.1145/321439.321443zbMath0157.50204OpenAlexW1975909277MaRDI QIDQ5540134

Leon Cooper, Robert E. Echols

Publication date: 1968

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321439.321443

zbMATH Keywords

operations research

Related Items (8)

Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben ⋮ A method to improve integer linear programming problem with branch-and-bound procedure ⋮ Heuristische Lösungsverfahren Versuch einer Begriffsklärung ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ Heuristische Verfahren zur Lösung allgemeiner ganzzahliger linearer Optimierungsprobleme (Ein überblick) ⋮ An implicit enumeration algorithm for the all integer programming problem ⋮ Large-scale mixed integer programming: Benders-type heuristics ⋮ An algorithm of internal feasible directions for linear integer programming

This page was built for publication: Solution of Integer Linear Programming Problems by Direct Search