Mixed integer programming for the 0--1 maximum probability model.
From MaRDI portal
Publication:1426689
DOI10.1016/S0377-2217(03)00122-XzbMath1043.90055MaRDI QIDQ1426689
Publication date: 15 March 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Stochastic programmingmodelMixed integer programmingComputational experimentsDiscrete maximum probability
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Fractional programming: Applications and algorithms
- A note on a global approach for general 0-1 fractional programming
- A global approach for general \(0-1\) fractional programming
- An efficient linearization approach for mixed-integer problems
- A linearization method for mixed 0--1 polynomial programs
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- Calculation of Investment Portfolios with Risk Free Borrowing and Lending
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- On Solving Fractional (0, 1) Programs By Implicit Enumeration
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Programming with linear fractional functionals
- Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
- Approximate And Exact Solution Methods For The Hyperbolic 0-1 Knapsack Problem