Pivot and Complement–A Heuristic for 0-1 Programming
From MaRDI portal
Publication:3885518
DOI10.1287/mnsc.26.1.86zbMath0442.90060OpenAlexW2026106837MaRDI QIDQ3885518
Clarence H. Martin, Egon Balas
Publication date: 1980
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.26.1.86
approximate solutionstest problemscomputational experienceheuristic methodcapital budgeting0-1 programming problemslarge integer programspivot and complement
Related Items (68)
An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem ⋮ Partial cover and complete cover inequalities ⋮ A lift-and-project cutting plane algorithm for mixed 0-1 programs ⋮ Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks ⋮ A heuristic for multiple choice programming ⋮ Heuristics for the multi-resource generalized assignment problem ⋮ A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem ⋮ Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 ⋮ A simulated annealing approach to the multiconstraint zero-one knapsack problem ⋮ Some results and experiments in programming techniques for propositional logic ⋮ Pivot and shift -- a mixed integer programming heuristic ⋮ A computational evaluation of optimal solution value estimation procedures ⋮ Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches ⋮ An empirical evaluation of walk-and-round heuristics for mixed integer linear programs ⋮ Scatter search and star-paths: Beyond the genetic metaphor ⋮ A note on the pivot and complement heuristic for 0-1 programming problems ⋮ Mathematical programming based heuristics for the 0--1 MIP: a survey ⋮ Nonlinear 0–1 programming: II. Dominance relations and algorithms ⋮ Networked bubble propagation: a polynomial-time hypothetical reasoning method for computing near-optimal solutions ⋮ Matheuristics: survey and synthesis ⋮ Steiner tree packing revisited ⋮ An interior point cutting plane heuristic for mixed integer programming ⋮ Variable neighborhood search: basics and variants ⋮ An exact algorithm for bilevel 0-1 knapsack problems ⋮ Modeling multiple plant sourcing decisions ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ Exact and heuristic solution approaches for the mixed integer setup knapsack problem ⋮ Multivariate composite distributions for coefficients in synthetic optimization problems ⋮ Generation of feasible integer solutions on a massively parallel computer using the feasibility pump ⋮ A polyhedral approach to edge coloring ⋮ Essential particle swarm optimization queen with tabu search for MKP resolution ⋮ Repairing MIP infeasibility through local branching ⋮ A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles ⋮ Boosting the feasibility pump ⋮ Sequencing offshore oil and gas fields under uncertainty ⋮ A feasibility pump heuristic for general mixed-integer problems ⋮ Improving the feasibility pump ⋮ A survey of algorithms for the generalized assignment problem ⋮ Mixed-integer bilinear programming problems ⋮ A multi-level search strategy for the 0-1 multidimensional knapsack problem ⋮ Variable neighborhood search and local branching ⋮ A first look at picking dual variables for maximizing reduced cost fixing ⋮ Exploring relaxation induced neighborhoods to improve MIP solutions ⋮ Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search ⋮ A computational study of parametric tabu search for 0-1 mixed integer programs ⋮ Scheduling experiments on a nulear reactor using mixed integer programming ⋮ Improved results on the 0--1 multidimensional knapsack problem ⋮ A hybrid algorithm for the generalized assignment problem ⋮ A Simulated Annealing Algorithm for General Zero-One Programming Problems ⋮ An aggressive reduction scheme for the simple plant location problem ⋮ On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs ⋮ A branch and bound algorithm for solving the multiple-choice knapsack problem ⋮ Heuristic methods and applications: A categorized survey ⋮ Feasibility pump 2.0 ⋮ The feasibility pump ⋮ A heuristic algorithm for the multidimensional zero-one knapsack problem ⋮ Large-scale mixed integer programming: Benders-type heuristics ⋮ Combinatorial optimization: current successes and directions for the future ⋮ Zero-one integer programs with few contraints - lower bounding theory ⋮ Generalized relax-and-fix heuristic ⋮ Heuristics and reduction methods for multiple constraints 0-1 linear programming problems ⋮ Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality ⋮ Data dependent worst case bound improving techniques in zero-one programming ⋮ The capacity expansion problem in the service industry ⋮ Solving zero-one mixed integer programming problems using tabu search ⋮ An efficient tabu search approach for the 0-1 multidimensional knapsack problem ⋮ The multidimensional 0-1 knapsack problem -- bounds and computational aspects ⋮ On a fix-and-relax framework for a class of project scheduling problems
This page was built for publication: Pivot and Complement–A Heuristic for 0-1 Programming
