Pages that link to "Item:Q1785273"
From MaRDI portal
The following pages link to Integer convex minimization by mixed integer linear optimization (Q1785273):
Displaying 15 items.
- A polynomial algorithm for minimizing discrete convic functions in fixed dimension (Q2192061) (← links)
- The (not so) trivial lifting in two dimensions (Q2281447) (← links)
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
- On the complexity of quasiconvex integer minimization problem (Q2423784) (← links)
- Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
- Minimizing a Symmetric Quasiconvex Function on a Two-Dimensional Lattice (Q4558294) (← links)
- Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
- Minimization of even conic functions on the two-dimensional integral lattice (Q5090143) (← links)
- (Q5092394) (← links)
- (Q5381125) (← links)
- Centerpoints: A Link between Optimization and Convex Geometry (Q5737732) (← links)
- Parameterized shifted combinatorial optimization (Q5915595) (← links)
- On efficient algorithms for finding efficient salvo policies (Q6046641) (← links)
- Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube (Q6155880) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
