Cuts for Mixed 0-1 Conic Programming

Mathematical Programming, Series B - Germany
doi 10.1007/s10107-005-0578-3
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

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

Journal of Japan Society for Fuzzy Theory and Systems
1998English

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

Management Science
Management ScienceManagementOperations ResearchStrategy
1996English

Variable Neighbourhood Decomposition Search for 0–1 Mixed Integer Programs

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2010English

Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1993English

Pattern Search Algorithms for Mixed Variable Programming

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2001English

Chvátal Closures for Mixed Integer Programming Problems

Mathematical Programming, Series B
MathematicsSoftware
1990English

A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
2003English

Technical Note—The Use of Cuts in Complementary Programming

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1973English

Optimal Design of Conic-Cylindrical Gear Reduction Unit Using Fuzzy Physical Programming

English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy