An Additive Algorithm for Solving Linear Programs with Zero-One Variables
From MaRDI portal
Publication:5589736
DOI10.1287/OPRE.13.4.517zbMath0194.19903OpenAlexW2100890245WikidataQ96289570 ScholiaQ96289570MaRDI QIDQ5589736
Publication date: 1965
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.13.4.517
Related Items (90)
A heuristic routine for solving large loading problems ⋮ Least trimmed squares regression, least median squares regression, and mathematical program\-ming ⋮ The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems ⋮ Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben ⋮ A single-branch implicit enumeration algorithm for zero-one programs with geometrical constraints ⋮ On the reduction method for integer linear programs. II ⋮ A constraint generation scheme to probabilistic linear problems with an application to power system expansion planning ⋮ Multi-item capacitated lot-sizing by a cross decomposition based algorithm ⋮ Optimal bivariate clustering and a genetic algorithm with an application in cellular manufacturing ⋮ A partial enumeration algorithm for pure nonlinear integer programming ⋮ A new node selection strategy in the branch-and-bound procedure ⋮ A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings ⋮ Surrogate duality in a branch-and-bound procedure for integer programming ⋮ Parametric methods in integer linear programming ⋮ Iterative variable aggregation and disaggregation in IP: an application ⋮ Aggregation of constraints in integer programming ⋮ Minimal covering problem and PLA minimization ⋮ Discrete dynamical system approaches for Boolean polynomial optimization ⋮ A binary integer linear program with multi-criteria and multi-constraint levels ⋮ Networked bubble propagation: a polynomial-time hypothetical reasoning method for computing near-optimal solutions ⋮ Experiments in integer programming ⋮ A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement ⋮ Les procedures arborescentes d’optimisation ⋮ A hybrid approach to resolving a differentiable integer program. ⋮ An exact method for partitioning dichotomous items within the framework of the monotone homogeneity model ⋮ On maintenance scheduling of production units ⋮ An implicit enumeration program for zero-one integer programming ⋮ Unnamed Item ⋮ An algorithm for the multiple objective integer linear programming problem ⋮ An effective structured approach to finding optimal partitions of networks ⋮ Hyperspheric Integer Programming ⋮ The sequential problem under uncertainty. The development of water systems ⋮ Generalized dynamic programming methods in integer programming ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ Analysis of mathematical programming problems prior to applying the simplex algorithm ⋮ Models and methods of solution of quadratic integer programming problems ⋮ Branch-and-bound as a higher-order function ⋮ A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles ⋮ A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem ⋮ Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method ⋮ Ein lexikographischer Suchalgorithmus zur ganzzahligen Programmierung: L E X S ⋮ Mixed-integer bilinear programming problems ⋮ Construction of cyclic designs using integer programming ⋮ Modeling and algorithmic development of a staff scheduling problem ⋮ Numerische Erfahrungen mit der Filtermethode von Balas in der linearen binären Optimierung ⋮ Cost-minimal trees in directed acyclic graphs ⋮ Application of optimization methods to the hematological support of patients with disseminated malignancies ⋮ On the complexity of discrete programming problems ⋮ A heuristic preprocessor supported algorithm for the capacitated plant location problem ⋮ Maximum Capacity Path Interdiction Problem with Fixed Costs ⋮ Computational experiments with a class of dynamic programming algorithms of higher dimensions ⋮ Unnamed Item ⋮ An implicit enumeration algorithm for the all integer programming problem ⋮ Unnamed Item ⋮ Zero-one programming with many variables and few constraints ⋮ An exact algorithm for the two-mode \(KL\)-means partitioning problem ⋮ The Collapsing 0–1 Knapsack Problem ⋮ Two stage linear programming under uncertainty with 0–1 integer first stage variables ⋮ Computational experience with an algorithm for 0-1 integer programming ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type ⋮ Structural approach to parametric analysis of an IP. On the case of the right-hand side ⋮ Analyse de sensibilité pour les problèmes linéaires en variables 0-1 ⋮ An improved partial enumeration algorithm for integer programming problems ⋮ A duality theorem and an algorithm for (mixed-) integer nonlinear programming ⋮ Algorithms for sequential analysis and fathoming in discrete optimization problems ⋮ Global optimization of measurement strategies for linear stochastic systems ⋮ An outline of linear programming ⋮ The simple plant location problem: Survey and synthesis ⋮ Calculating uncertainty intervals in approximate equation systems ⋮ Exploring the constrained maximum edge-weight connected graph problem ⋮ State-of-the-art exact and heuristic solution procedures for simple assembly line balancing ⋮ Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds ⋮ Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis ⋮ An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs ⋮ Soft OR and Practice: The Contribution of the Founders of Operations Research ⋮ A two-stage cutting-plane method for conditional minimizing function ⋮ Parameterisation algorithms for the integer linear programs in binary variables ⋮ Zero-one integer programs with few contraints - lower bounding theory ⋮ Capital budgeting with Benders' decomposition ⋮ Die Lösung eines nichtlinearen Investitionsproblems mit Hilfe binärer Optimierungsalgorithmen — gezeigt am Beispiel der Planung regionaler Abwasserbehandlungssysteme ⋮ Trivial integer programs unsolvable by branch-and-bound ⋮ An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type ⋮ Modelling a fertiliser distribution system ⋮ An approach to the solution of the set-covering problem ⋮ A primal-like algorithm for zero-one integer Fractional Programming Problem ⋮ Multiproduct production planning in the presence of work-force learning ⋮ Logic-based modeling and solution of nonlinear discrete/continuous optimization problems ⋮ Logical processing for integer programming ⋮ An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions
This page was built for publication: An Additive Algorithm for Solving Linear Programs with Zero-One Variables
