On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
From MaRDI portal
Publication:5568931
DOI10.1287/opre.17.4.680zbMath0176.49805OpenAlexW2053060496MaRDI QIDQ5568931
Publication date: 1969
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.17.4.680
Related Items
A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron, Introduction to QUBO, Penalty formulation for zero-one nonlinear programming, New results on the equivalence between zero-one programming and continuous concave programming, Continuous quadratic programming formulations of optimization problems on graphs, A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming, Global minimization of large-scale constrained concave quadratic problems by separable programming, On some connections among variational inequalities, combinatorial and continuous optimization, Global optimization algorithm for solving linear multiplicative programming problems, A gradient-based approach for discrete optimum design, Convergence of a continuous approach for zero-one programming problems, An exact penalty global optimization approach for mixed-integer programming problems, Continuous reformulations for zero-one programming problems, Cut search methods in integer programming, A fundamental problem in linear inequalities with applications to the travelling salesman problem, Computer experiments on quadratic programming algorithms, A smoothing method for zero--one constrained extremum problems, Integer programming and convex analysis: Intersection cuts from outer polars, Membership functions, some mathematical programming models and production scheduling, On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope, Global maximization of a generalized concave multiplicative function, On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems, An interior point algorithm to solve computationally difficult set covering problems, Reduction of indefinite quadratic programs to bilinear programs, Lagrangean duality for facial programs with applications to integer and complementarity problems, Penalty for zero–one integer equivalent problem, Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization, A cutting plane algorithm for solving bilinear programs, Maximization of A convex quadratic function under linear constraints, Quasi-concave minimization subject to linear constraints, A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron, Exact penalty functions for nonlinear integer programming problems, Outer space branch and bound algorithm for solving linear multiplicative programming problems, Separable concave minimization via partial outer approximation and branch and bound, Integrality gap minimization heuristics for binary mixed integer nonlinear programming, Inscribed ball and enclosing box methods for the convex maximization problem, Combinatorial optimization in Nash games, On duality for Boolean programming, A branch and bound-outer approximation algorithm for concave minimization over a convex set, Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint, On cutting planes for cardinality-constrained linear programs, Convergence of a subgradient method for computing the bound norm of matrices, On the global minimization of concave functions, Depth-optimized convexity cuts
