Mixed integer programming for the 0--1 maximum probability model.

DOI10.1016/S0377-2217(03)00122-XzbMath1043.90055MaRDI QIDQ1426689

Alain Billionnet

Publication date: 15 March 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Stochastic programmingmodelMixed integer programmingComputational experimentsDiscrete maximum probability

Mathematics Subject Classification ID

Mixed integer programming (90C11) Stochastic programming (90C15)

Related Items

Markov chain methods for the bipartite Boolean quadratic programming problem

Uses Software

• AMPL
• XA

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