Variable Neighbourhood Decomposition Search for 0–1 Mixed Integer Programs

Computers and Operations Research- United Kingdom

doi 10.1016/j.cor.2009.09.010

Full Text

Abstract

Available in

Date

Authors

Publisher

Elsevier BV

Related search

A Facet Generation Procedure for Solving 0/1 Integer Programs

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1999Danish

A Hybrid Integer Programming and Variable Neighbourhood Search Algorithm to Solve Nurse Rostering Problems

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2017English

Active-Constraint Variable Ordering Schemes for Faster Feasibility of Mixed Integer Linear Programs

English

Analyzing Infeasible Mixed-Integer and Integer Linear Programs

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
1999English

Coefficient Strengthening: A Tool for Formulating Mixed Integer Programs

SSRN Electronic Journal
2007English

Pattern Search Algorithms for Mixed Variable Programming

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2001English

Automatic Dantzig–Wolfe Reformulation of Mixed Integer Programs

Mathematical Programming, Series B
MathematicsSoftware
2014English

On the Mixed Integer Randomized Pattern Search Algorithm

Revista de la Union Matematica Argentina
Mathematics
2019English

Decomposition Techniques With Mixed Integer Programming and Heuristics for Home Healthcare Planning

Annals of Operations Research
Management ScienceDecision SciencesOperations Research
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy