Solution of Integer Linear Programming Problems by Direct Search

DOI10.1145/321439.321443MaRDI QIDQ5540134zbMATH OpenOpenAlexFDO

Authors Robert E. Echols, Leon Cooper

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

Cited in

(8)

• Heuristische Lösungsverfahren Versuch einer Begriffsklärung
• 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
• A method to improve integer linear programming problem with branch-and-bound procedure
• The multidimensional 0-1 knapsack problem: an overview.
• An algorithm of internal feasible directions for linear integer programming
• Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5540134)