An Additive Algorithm for Solving Linear Programs with Zero-One Variables

Cited In (93)

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

This page was built for publication: An Additive Algorithm for Solving Linear Programs with Zero-One Variables

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