Pivot and Complement–A Heuristic for 0-1 Programming
From MaRDI portal
Cited in
(70)- Feasibility pump 2.0
- Zero-one integer programs with few contraints - lower bounding theory
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
- A heuristic for multiple choice programming
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- Some results and experiments in programming techniques for propositional logic
- A computational evaluation of optimal solution value estimation procedures
- A note on the pivot and complement heuristic for 0-1 programming problems
- A polyhedral approach to edge coloring
- Sequencing offshore oil and gas fields under uncertainty
- A survey of algorithms for the generalized assignment problem
- The capacity expansion problem in the service industry
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- Partial cover and complete cover inequalities
- Networked bubble propagation: a polynomial-time hypothetical reasoning method for computing near-optimal solutions
- The multidimensional 0-1 knapsack problem: an overview.
- Combinatorial optimization: current successes and directions for the future
- Solving zero-one mixed integer programming problems using tabu search
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Variable neighborhood search: basics and variants
- Generation of feasible integer solutions on a massively parallel computer using the feasibility pump
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Improved results on the 0--1 multidimensional knapsack problem
- Heuristic methods and applications: A categorized survey
- A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- Scatter search and star-paths: Beyond the genetic metaphor
- Steiner tree packing revisited
- An exact algorithm for bilevel 0-1 knapsack problems
- Multivariate composite distributions for coefficients in synthetic optimization problems
- A first look at picking dual variables for maximizing reduced cost fixing
- On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs
- Generalized relax-and-fix heuristic
- 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
- Pivot and shift -- a mixed integer programming heuristic
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
- Mathematical programming based heuristics for the 0--1 MIP: a survey
- Repairing MIP infeasibility through local branching
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- Variable neighborhood search and local branching
- An aggressive reduction scheme for the simple plant location problem
- The feasibility pump
- Nonlinear 0–1 programming: II. Dominance relations and algorithms
- A hybrid algorithm for the generalized assignment problem
- A Simulated Annealing Algorithm for General Zero-One Programming Problems
- Modeling multiple plant sourcing decisions
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Heuristics for the multi-resource generalized assignment problem
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- Essential particle swarm optimization queen with tabu search for MKP resolution
- Boosting the feasibility pump
- Scheduling experiments on a nulear reactor using mixed integer programming
- Matheuristics: survey and synthesis
- An interior point cutting plane heuristic for mixed integer programming
- A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack
- Mixed-integer bilinear programming problems
- Arc-consistency with linear programming reduced costs (applied to stable set in chordal graphs)
- 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
- A branch and bound algorithm for solving the multiple-choice knapsack problem
- A heuristic algorithm for the multidimensional zero-one knapsack problem
- Large-scale mixed integer programming: Benders-type heuristics
- Data dependent worst case bound improving techniques in zero-one programming
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- On a fix-and-relax framework for a class of project scheduling problems
- Exact and heuristic solution approaches for the mixed integer setup knapsack problem
- A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
This page was built for publication: Pivot and Complement–A Heuristic for 0-1 Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3885518)
