Pages that link to "Item:Q5656593"
From MaRDI portal
The following pages link to A Balasian-Based Algorithm for Zero-One Polynomial Programming (Q5656593):
Displaying 15 items.
- The indefinite zero-one quadratic problem (Q585083) (← links)
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
- Reformulating nonlinear combinatorial optimization problems for higher computational efficiency (Q1194735) (← links)
- An approximate method for local optima for nonlinear mixed integer programming problems (Q1200840) (← links)
- Configuration of manufacturing software through capability specification and selection (Q1323732) (← links)
- A hybrid approach to resolving a differentiable integer program. (Q1406652) (← links)
- A discrete optimization model for preserving biological diversity (Q1909481) (← links)
- The basic algorithm for pseudo-Boolean programming revisited (Q2277139) (← links)
- Compact integer-programming models for extracting subsets of stimuli from confusion matrices (Q2511847) (← links)
- An algorithm for indefinite integer quadratic programming (Q2641219) (← links)
- Nonlinear 0–1 programming: I. Linearization techniques (Q3216430) (← links)
- Nonlinear 0–1 programming: II. Dominance relations and algorithms (Q3216431) (← links)
- An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions (Q3960473) (← links)
- A revised Taha's algorithm for polynomial 0-1 programming (Q5426969) (← links)
- An approximate algorithm for nonlinear integer programming (Q5906559) (← links)
