A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem

Cited in

(72)

Development of a new approach for deterministic supply chain network design
Zero-one integer programs with few contraints - lower bounding theory
Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
Surrogate dual problems and surrogate Lagrangians
A general theory of dual optimization 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
Surrogate duality in a branch-and-bound procedure for integer programming
An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem
The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm
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 constraint generation scheme to probabilistic linear problems with an application to power system expansion planning
Optimization by ghost image processes in neural networks
The multidimensional 0-1 knapsack problem: an overview.
A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
An efficient tabu search approach for the 0-1 multidimensional knapsack problem
Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem
Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
Future paths for integer programming and links to artificial intelligence
Some new perspectives for solving 0--1 integer programming problems using balas method
On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs
On generalized surrogate duality in mixed-integer nonlinear programming
A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
Duality theorems for convex and quasiconvex set functions
Zero duality gap in surrogate constraint optimization: a concise review of models
Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
Surrogate duality for robust optimization
Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution
A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
A duality theorem and an algorithm for (mixed-) integer nonlinear programming
Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds
The multiobjective multidimensional knapsack problem: a survey and a new approach
Abstract pontryagin maximum principles for linear systems
Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
Methods for a class of discrete location problems
On the complexity of the surrogate dual of 0–1 programming
Surrogate duality for vector optimization
Quasiconvex duality theory by generalized conjugation methods
Two stage linear programming under uncertainty with 0–1 integer first stage variables
Surrogate Constraints in Integer Programming
Resolution of the 0–1 knapsack problem: Comparison of methods
Necessary and sufficient constraint qualification for surrogate duality
Theoretical comparisons of search strategies in branch-and-bound algorithms
A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
Trivial integer programs unsolvable by branch-and-bound
On generalized surrogate duality in mixed-integer nonlinear programming
Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints
Improved convergent heuristics for the 0-1 multidimensional knapsack problem
Concurrent optimization of assembly tolerances for quality with position control using scatter search approach
Surrogate dual method for multi-dimensional nonlinear knapsack problems
On the existence of duality gaps for mixed integer programming
scientific article; zbMATH DE number 3390546 (Why is no real title available?)
An implicit enumeration program for zero-one integer programming
Experimentation with Benders decomposition for solving the two-timescale stochastic generation capacity expansion problem
A surrogate-based heuristic for production planning problem of orders in small foundries
Parallel implementation of an exact two-phase method for the biobjective knapsack problem
On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints
Contemporary approaches in matheuristics an updated survey
Aggregation of bilinear bipartite equality constraints and its application to structural model updating problem
Parameterisation algorithms for the integer linear programs in binary variables
Best approximation and optimization
The multidimensional 0-1 knapsack problem -- bounds and computational aspects
Logical processing for integer programming
Lower bounds and heuristic algorithms for the k_i-partitioning problem
Exploiting nested inequalities and surrogate constraints
A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement
A surrogate and Lagrangian approach to constrained network problems
Second-order cover inequalities
Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities
Surrogate constraint normalization for the set covering problem

This page was built for publication: A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem

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