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