Mixed 0-1 Programming by Lift-And-Project in a Branch-And-Cut Framework

Management Science - United States
doi 10.1287/mnsc.42.9.1229
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Related search

Cuts for Mixed 0-1 Conic Programming

Mathematical Programming, Series B
MathematicsSoftware
2005English

Mixed 0-1 Programming Through Benders' Partitioning Procedures and Genetic Algorithms

Journal of Japan Society for Fuzzy Theory and Systems
1998English

Heuristics of the Branch-Cut-And-Price-Framework SCIP

English

A Branch-And-Bound Algorithm for Zero-One Mixed Integer Programming Problems

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1971English

Integer Programming Models and Branch-And-Cut Approaches to Generalized {0,1,2}-Survivable Network Design Problems

Computational Optimization and Applications
ControlComputational MathematicsApplied MathematicsOptimization
2016English

A Branch-And-Cut Algorithm for Partition Coloring

Networks
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
2009English

Lift and Cut: Anti-Host Autophagy Mechanism of Legionella Pneumophila

Autophagy
Cell BiologyMolecular Biology
2017English

Tuning Optical Absorption Edge by Composition and Temperature in TlGaS2xSe2(1-x)Layered Mixed Crystals (0 ≤ X ≤ 1)

Acta Physica Polonica A
AstronomyPhysics
2012English

Solving the Orienteering Problem Through Branch-And-Cut

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

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy