Pages that link to "Item:Q2897310"
From MaRDI portal
The following pages link to On the Complexity of Nonlinear Mixed-Integer Optimization (Q2897310):
Displaying 19 items.
- Optimizing a multi-stage production/inventory system by DC programming based approaches (Q461449) (← links)
- Intractability of approximate multi-dimensional nonlinear optimization on independence systems (Q533792) (← links)
- Scheduling and fixed-parameter tractability (Q896271) (← links)
- A note on a pair of nonlinear mixed integer programming problems (Q1095030) (← links)
- Nonlinear integer programming by Darwin and Boltzmann mixed strategy (Q1291726) (← links)
- Knapsack with variable weights satisfying linear constraints (Q1683329) (← links)
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held October 18--24, 2015 (Q1698018) (← links)
- The complexity of approximating a nonlinear program (Q1906280) (← links)
- Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem (Q2311115) (← links)
- Optimal dynamic formation control of multi-agent systems in constrained environments (Q2409298) (← links)
- On the complexity of quasiconvex integer minimization problem (Q2423784) (← links)
- Minimizing cubic and homogeneous polynomials over integers in the plane (Q2806816) (← links)
- (Q4233341) (← links)
- (Q4331736) (← links)
- Short Presburger Arithmetic Is Hard (Q5073520) (← links)
- Mixed-Integer Convex Representability (Q5076722) (← links)
- Some graph optimization problems with weights satisfying linear constraints (Q5918487) (← links)
- Related machine scheduling with machine speeds satisfying linear constraints (Q5918518) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
