Pages that link to "Item:Q697562"
From MaRDI portal
The following pages link to Non-standard approaches to integer programming (Q697562):
Displaying 22 items.
- Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
- Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (Q537960) (← links)
- Vectors in a box (Q715080) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Decomposition of integer programs and of generating sets (Q826076) (← links)
- A partial enumeration algorithm for pure nonlinear integer programming (Q838194) (← links)
- The power of pyramid decomposition in Normaliz (Q898277) (← links)
- A generalization of the integer linear infeasibility problem (Q924629) (← links)
- Relations between facets of low- and high-dimensional group problems (Q964183) (← links)
- An improved partial enumeration algorithm for integer programming problems (Q1026562) (← links)
- Integer programming, Barvinok's counting algorithm and Gomory relaxations. (Q1417591) (← links)
- New linearizations of quadratic assignment problems (Q1761235) (← links)
- On the lattice programming gap of the group problems (Q1785637) (← links)
- Could we use a million cores to solve an integer program? (Q1935943) (← links)
- Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems (Q2250079) (← links)
- Extended formulations for Gomory corner polyhedra (Q2386199) (← links)
- Generating functions and duality for integer programs (Q2386200) (← links)
- Valid inequalities based on simple mixed-integer sets (Q2583149) (← links)
- Effective lattice point counting in rational convex polytopes (Q2643564) (← links)
- Existence of unimodular triangulations — positive results (Q3380553) (← links)
- Multivariable Branching: A 0-1 Knapsack Problem Case Study (Q5084602) (← links)
- New Bounds for the Integer Carathéodory Rank (Q6136661) (← links)