Pages that link to "Item:Q1194735"
From MaRDI portal
The following pages link to Reformulating nonlinear combinatorial optimization problems for higher computational efficiency (Q1194735):
Displayed 7 items.
- Two-stage quadratic integer programs with stochastic right-hand sides (Q431020) (← links)
- A linearization framework for unconstrained quadratic (0-1) problems (Q1025991) (← links)
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992) (← links)
- Compact linearization for binary quadratic problems subject to assignment constraints (Q1728408) (← links)
- Computational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in De Novo protein design (Q2576440) (← links)
- Overcoming the Key Challenges in De Novo Protein Design: Enhancing Computational Efficiency and Incorporating True Backbone Flexibility (Q4607140) (← links)
- Inductive linearization for binary quadratic programs with linear constraints (Q6057718) (← links)