Pages that link to "Item:Q1195974"
From MaRDI portal
The following pages link to A Monte-Carlo approach for 0-1 programming problems (Q1195974):
Displaying 7 items.
- A discrete dynamic convexized method for nonlinear integer programming (Q953398) (← links)
- Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming (Q1017442) (← links)
- On polynomial complexity of a stochastic algorithm for mixed zero-one programs. (Q1421463) (← links)
- Mixed integer programming for the 0--1 maximum probability model. (Q1426689) (← links)
- A new filled function method for nonlinear integer programming problem (Q2489450) (← links)
- Monte-Carlo approximation algorithms for enumeration problems (Q3834934) (← links)
- An approximate algorithm for nonlinear integer programming (Q5906393) (← links)