An interior point algorithm to solve computationally difficult set covering problems
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Large-scale problems in mathematical programming (90C06) Boolean programming (90C09) Integer programming (90C10)
The authors consider the following integer programming problem: Find \(w\in R^ n\) such that \(B^ T w\leq b\), \(w_ i=\{-1,1\}\) \((i=1,\dots,m)\), \(B\in R^{m\times n}\), \(b\in R^ n\). The paper proposes an inner point method to achieve feasible points through an optimization problem for nonconvex potentials. This nonconvex optimization procedure is made on an ellipsoid. Experience with several large test problems is also reported in detail in the paper.
- A method for the solution of certain non-linear problems in least squares
- A note on some computationally difficult set covering problems
- A probabilistic heuristic for a computationally difficult set covering problem
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- An Improved Implicit Enumeration Approach for Integer Programming
- Computing a Trust Region Step
- Computing Optimal Locally Constrained Steps
- Concave Programming Applied to a Special Class of 0-1 Integer Programs
- Constrained global optimization: algorithms and applications
- Efficient Heuristic Procedures for Integer Linear Programming with an Interior
- Experimental results on Hillier's linear search
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3550465 (Why is no real title available?)
- scientific article; zbMATH DE number 3550466 (Why is no real title available?)
- scientific article; zbMATH DE number 4197756 (Why is no real title available?)
- Interior Path Methods for Heuristic Integer Programming Procedures
- Methods for Global Concave Minimization: A Bibliographic Survey
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- Penalty for zero–one integer equivalent problem
- Smoothing by spline functions. II
- Technical Note—A Note on Zero-One Integer and Concave Programming
- An implicit space covering method with applications to fixed point and global optimization problems
- Solving combinatorial optimization problems using Karmarkar's algorithm
- An intelligent algorithm for mixed-integer programming models
- Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid
- Investigation of path-following algorithms for signomial geometric programming problems
- An exact algorithm for the maximum stable set problem
- Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach
- A branch bound method for subset sum problem
- Potential reduction algorithms for structured combinatorial optimization problems
- A potential reduction approach to the frequency assignment problem
- Trust region affine scaling algorithms for linearly constrained convex and concave programs
- The design of a 0-1 integer optimizer and its application in the Carmen system
- Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT
- An algorithm for large scale 0-1 integer programming with application to airline crew scheduling
- Matrix representation and gradient flows for NP-hard problems
- An approach to guided learning of Boolean functions
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- On the minimum number of logical clauses inferred from examples
- Solving hard set covering problems
- Solving large Steiner Triple Covering Problems
- A continuous approch for globally solving linearly constrained quadratic
- Improved solutions to the Steiner triple covering problem
- Constraint Orbital Branching
- Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems
- Models and solution techniques for frequency assignment problems
- An efficient mean field approach to the set covering problem
- Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem
- A random-key GRASP for combinatorial optimization
- A continuous approach to inductive inference
- A biased random-key genetic algorithm for the Steiner triple covering problem
- Computational experience with an interior point algorithm on the satisfiability problem
- Interior-point algorithms for global optimization
This page was built for publication: An interior point algorithm to solve computationally difficult set covering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1181917)
