Direct Search Algorithms for Zero-One and Mixed-Integer Programming

DOI10.1287/opre.15.5.892zbMath0168.18201OpenAlexW2008994564WikidataQ96289410 ScholiaQ96289410MaRDI QIDQ5553818

Kurt Spielberg, C. E. Lemke

Publication date: 1967

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.15.5.892

zbMATH Keywords

operations research

Related Items (27)

Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben ⋮ Extreme point Quadratic Minimization Problem ⋮ Minimal covering problem and PLA minimization ⋮ Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben ⋮ A direct dual method for the mixed plant location problem with some side constraints ⋮ Experiments in integer programming ⋮ Résolution des programmes linéaires a variables mixtes par la procédure S.E.P. ⋮ A Lagrangean dual ascent algorithm for simple plant location problems ⋮ On maintenance scheduling of production units ⋮ An implicit enumeration program for zero-one integer programming ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ Capacitated lot-sizing and scheduling by Lagrangean relaxation ⋮ My experiences as a student and researcher in OR during the 1960's and 70's ⋮ IP over 40+ years at IBM scientific centers and marketing ⋮ Experiments in mixed-integer linear programming using pseudo-costs ⋮ Application of optimization methods to the hematological support of patients with disseminated malignancies ⋮ Unnamed Item ⋮ An implicit enumeration algorithm for the all integer programming problem ⋮ Two stage linear programming under uncertainty with 0–1 integer first stage variables ⋮ Time-cost Trade-off Relations in Bulk Transportation Problem ⋮ A duality theorem and an algorithm for (mixed-) integer nonlinear programming ⋮ Extreme point programming with nonlinear constraints ⋮ The simple plant location problem: Survey and synthesis ⋮ The multidimensional 0-1 knapsack problem -- bounds and computational aspects ⋮ Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem ⋮ Logical processing for integer programming ⋮ Airline crew scheduling: state-of-the-art

This page was built for publication: Direct Search Algorithms for Zero-One and Mixed-Integer Programming