A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
From MaRDI portal
Publication:5548075
DOI10.1287/opre.13.6.879zbMath0163.41301OpenAlexW2076756604WikidataQ96291200 ScholiaQ96291200MaRDI QIDQ5548075
Publication date: 1965
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.13.6.879
Related Items (67)
Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem ⋮ An exact algorithm for the 0-1 collapsing knapsack problem ⋮ An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem ⋮ Tabu search for nonlinear and parametric optimization (with links to genetic algorithms) ⋮ A general theory of dual optimization problems ⋮ On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming ⋮ Methods for a class of discrete location problems ⋮ A single-branch implicit enumeration algorithm for zero-one programs with geometrical constraints ⋮ A general theory of surrogate dual and perturbational extended surrogate dual optimization problems ⋮ A constraint generation scheme to probabilistic linear problems with an application to power system expansion planning ⋮ Optimization by ghost image processes in neural networks ⋮ Surrogate Constraints in Integer Programming ⋮ Surrogate duality in a branch-and-bound procedure for integer programming ⋮ On the complexity of the surrogate dual of 0–1 programming ⋮ Exploiting nested inequalities and surrogate constraints ⋮ Surrogate duality for vector optimization ⋮ Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution ⋮ Necessary and sufficient constraint qualification for surrogate duality ⋮ A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem ⋮ A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement ⋮ A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem ⋮ An implicit enumeration program for zero-one integer programming ⋮ A surrogate and Lagrangian approach to constrained network problems ⋮ Resolution of the 0–1 knapsack problem: Comparison of methods ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ Second-order cover inequalities ⋮ Duality theorems for convex and quasiconvex set functions ⋮ Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem ⋮ A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem ⋮ Abstract pontryagin maximum principles for linear systems ⋮ Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities ⋮ Quasiconvex duality theory by generalized conjugation methods ⋮ On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints ⋮ Zero duality gap in surrogate constraint optimization: a concise review of models ⋮ Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem ⋮ Improved convergent heuristics for the 0-1 multidimensional knapsack problem ⋮ Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints ⋮ Concurrent optimization of assembly tolerances for quality with position control using scatter search approach ⋮ Surrogate constraint normalization for the set covering problem ⋮ Unnamed Item ⋮ Surrogate dual method for multi-dimensional nonlinear knapsack problems ⋮ Two stage linear programming under uncertainty with 0–1 integer first stage variables ⋮ On the existence of duality gaps for mixed integer programming ⋮ Some new perspectives for solving 0--1 integer programming problems using balas method ⋮ Theoretical comparisons of search strategies in branch-and-bound algorithms ⋮ On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs ⋮ Future paths for integer programming and links to artificial intelligence ⋮ Development of a new approach for deterministic supply chain network design ⋮ A duality theorem and an algorithm for (mixed-) integer nonlinear programming ⋮ An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem ⋮ A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem ⋮ Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds ⋮ Parameterisation algorithms for the integer linear programs in binary variables ⋮ Zero-one integer programs with few contraints - lower bounding theory ⋮ Best approximation and optimization ⋮ The multiobjective multidimensional knapsack problem: a survey and a new approach ⋮ Heuristics and reduction methods for multiple constraints 0-1 linear programming problems ⋮ Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality ⋮ The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm ⋮ Trivial integer programs unsolvable by branch-and-bound ⋮ Surrogate dual problems and surrogate Lagrangians ⋮ An efficient tabu search approach for the 0-1 multidimensional knapsack problem ⋮ Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems ⋮ Surrogate duality for robust optimization ⋮ On generalized surrogate duality in mixed-integer nonlinear programming ⋮ The multidimensional 0-1 knapsack problem -- bounds and computational aspects ⋮ Logical processing for integer programming
This page was built for publication: A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
