Convex Approximations for Complete Integer Recourse Models

Mathematical Programming, Series B - Germany
doi 10.1007/s10107-003-0434-2
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Lipschitz Stability for Stochastic Programs With Complete Recourse

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
1996English

Duality Theorems for Non-Convex Mixed Integer Programming Problems

International Journal of Computing and Optimization
2016English

Decomposition Based Interior Point Methods for Two-Stage Stochastic Convex Quadratic Programs With Recourse

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
2009English

An Effective Branch-And-Bound Algorithm for Convex Quadratic Integer Programming

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Integer Circuit Evaluation Is PSPACE-Complete

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
2001English

Markov-Chain Approximations for Life-Cycle Models

Review of Economic Dynamics
EconomicsEconometrics
2019English

Local Convex Hulls for a Special Class of Integer Multicommodity Flow Problems

Computational Optimization and Applications
ControlComputational MathematicsApplied MathematicsOptimization
2016English

Use of Convex Model Approximations for Real-Time Optimization via Modifier Adaptation

Industrial & Engineering Chemistry Research
ChemistryChemical EngineeringManufacturing EngineeringIndustrial
2013English

Multipoint Linear Approximations for Stochastic Chance Constrained Optimization Problems With Integer Design Variables

2000English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy