Pages that link to "Item:Q1194735"
From MaRDI portal
The following pages link to Reformulating nonlinear combinatorial optimization problems for higher computational efficiency (Q1194735):
Displaying 13 items.
- Two-stage quadratic integer programs with stochastic right-hand sides (Q431020) (← links)
- Computationally attractive nonlinear models for combinatorial optimisation (Q843386) (← 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)
- Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering (Q2168744) (← links)
- Minimal conic quadratic reformulations and an optimization model (Q2294364) (← links)
- Computational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in De Novo protein design (Q2576440) (← links)
- Tightening concise linear reformulations of 0-1 cubic programs (Q2810099) (← links)
- Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization (Q3470249) (← links)
- Overcoming the Key Challenges in De Novo Protein Design: Enhancing Computational Efficiency and Incorporating True Backbone Flexibility (Q4607140) (← links)
- (Q4828109) (← links)
- Inductive linearization for binary quadratic programs with linear constraints (Q6057718) (← links)
