Pages that link to "Item:Q3037135"
From MaRDI portal
The following pages link to Integer Programming with a Fixed Number of Variables (Q3037135):
Displaying 50 items.
- A dichotomy for real weighted Holant problems (Q260401) (← links)
- On polynomial kernels for sparse integer linear programs (Q269481) (← links)
- Vertex cover meets scheduling (Q270025) (← links)
- A note on optical routing on trees (Q287098) (← links)
- A fixed point iterative approach to integer programming and its distributed computation (Q288180) (← links)
- Configurations and minority in the string consensus problem (Q289911) (← links)
- Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control (Q314421) (← links)
- Improved branching disjunctions for branch-and-bound: an analytic center approach (Q319920) (← links)
- Polynomial-time approximation schemes for circle and other packing problems (Q329299) (← links)
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing (Q336824) (← links)
- Polynomial kernels for weighted problems (Q340549) (← links)
- High-multiplicity scheduling on one machine with forbidden start and completion times (Q341471) (← links)
- Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
- Bias expansion of spatial statistics and approximation of differenced lattice point counts (Q353996) (← links)
- Testing additive integrality gaps (Q378120) (← links)
- The \(l\)-diversity problem: tractability and approximability (Q392037) (← links)
- New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors (Q393183) (← links)
- An approximation scheme for the two-stage, two-dimensional knapsack problem (Q429647) (← links)
- Pattern hit-and-run for sampling efficiently on polytopes (Q433826) (← links)
- Splitting full matrix algebras over algebraic number fields. (Q448406) (← links)
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines (Q463715) (← links)
- Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods (Q477331) (← links)
- A randomized sieving algorithm for approximate integer programming (Q486990) (← links)
- Parameterized complexity analysis for the closest string with wildcards problem (Q495996) (← links)
- Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring (Q533417) (← links)
- 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)
- Branching on general disjunctions (Q543420) (← links)
- Unbounded knapsack problems with arithmetic weight sequences (Q545110) (← links)
- On the complexity of cutting-plane proofs (Q580175) (← links)
- \(N\)-fold integer programming and nonlinear multi-transshipment (Q628649) (← links)
- Approximability of sparse integer programs (Q634673) (← links)
- Computing efficiently the lattice width in any dimension (Q638564) (← links)
- The minimum feasible tileset problem (Q666670) (← links)
- Unit-time scheduling problems with time dependent resources (Q678109) (← links)
- Improved approximation algorithms for parallel machine scheduling with release dates and job rejection (Q681293) (← links)
- Parameterizing by the number of numbers (Q692894) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Parametric integer programming algorithm for bilevel mixed integer programs (Q711715) (← links)
- Finding vertex-surjective graph homomorphisms (Q715053) (← links)
- Approximating vector scheduling: almost matching upper and lower bounds (Q727975) (← links)
- Integral infeasibility and testing total dual integrality (Q757248) (← links)
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice (Q757465) (← links)
- Deadlock and liveness characterization for a class of generalized Petri nets (Q780961) (← links)
- Integer programming and cryptography (Q799477) (← links)
- New algorithms for minimizing the weighted number of tardy jobs on a single machine (Q829184) (← links)
- Acyclic coloring parameterized by directed clique-width (Q831699) (← links)
- Parameterized complexity of locally minimal defensive alliances (Q831707) (← links)
- The balanced satisfactory partition problem (Q831826) (← links)
- Integer equal flows (Q833591) (← links)
