Pages that link to "Item:Q4221106"
From MaRDI portal
The following pages link to Theory of linear and integer programming. (Q4221106):
Displaying 50 items.
- A regularity result for shortest generalized billiard trajectories in convex bodies in \(\mathbb{R}^n\) (Q2164371) (← links)
- Total dual dyadicness and dyadic generating sets (Q2164668) (← links)
- An inherently consistent reproducing kernel gradient smoothing framework toward efficient Galerkin meshfree formulation with explicit quadrature (Q2174162) (← links)
- Subset selection for multiple linear regression via optimization (Q2182858) (← links)
- \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited (Q2186293) (← links)
- On compatible triangulations with a minimum number of Steiner points (Q2192383) (← links)
- Symmetry of eigenvalues of Sylvester matrices and tensors (Q2197821) (← links)
- On mean values of multivariable complex valued multiplicative functions and applications (Q2214489) (← links)
- Mixed-integer bilevel representability (Q2220657) (← links)
- A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem (Q2228402) (← links)
- Type and conductor of simplicial affine semigroups (Q2229964) (← links)
- GKZ-hypergeometric systems for Feynman integrals (Q2230219) (← links)
- The main vertices of a star set and related graph parameters (Q2231707) (← links)
- Tree-like unit refutations in Horn constraint systems (Q2232285) (← links)
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints (Q2238737) (← links)
- Quantum violation of the suppes-zanotti inequalities and ``contextuality'' (Q2239595) (← links)
- On lattice-free orbit polytopes (Q2256587) (← links)
- Decision support for strategic energy planning: a robust optimization framework (Q2273910) (← links)
- Computing Walrasian equilibria: fast algorithms and structural properties (Q2288196) (← links)
- Random sampling and machine learning to understand good decompositions (Q2288981) (← links)
- Formal solution of an interval system of linear equations with an application in static responses of structures with interval forces (Q2294157) (← links)
- On linear operators preserving certain cones in \(\mathbb{R}^n\) (Q2299380) (← links)
- Semi-automatically optimized calibration of internal combustion engines (Q2303522) (← links)
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
- FPT-algorithm for computing the width of a simplex given by a convex hull (Q2314204) (← links)
- Efficient approximation algorithms for maximum coverage with group budget constraints (Q2317355) (← links)
- A new arithmetic criterion for graphs being determined by their generalized \(Q\)-spectrum (Q2317643) (← links)
- Two variations of graph test in double description method (Q2322740) (← links)
- Finding MEMo: minimum sets of elementary flux modes (Q2330632) (← links)
- On cutting planes for cardinality-constrained linear programs (Q2330656) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Solving strong controllability of temporal problems with uncertainty using SMT (Q2342602) (← links)
- On the complexity and approximability of budget-constrained minimum cost flows (Q2361495) (← links)
- Analysis of an algorithm to compute the cohomology groups of coherent sheaves and its applications (Q2364350) (← links)
- Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic'' (Q2364369) (← links)
- An optimization algorithm based on chaotic behavior and fractal nature (Q2370711) (← links)
- Adaptive modeling, adaptive data assimilation and adaptive sampling (Q2371208) (← links)
- Enumerating trichromatic triangles containing the origin in linear time (Q2376788) (← links)
- Two new algorithms for UMTS access network topology design (Q2387233) (← links)
- Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability (Q2409675) (← links)
- Perfect fractional matchings in \(k\)-out hypergraphs (Q2409824) (← links)
- Matrices with lexicographically-ordered rows (Q2414107) (← links)
- Optimal constraints aggregation method for ILP (Q2416430) (← links)
- A feasible rounding approach for mixed-integer optimization problems (Q2419508) (← links)
- Integrality gaps for colorful matchings (Q2419586) (← links)
- On the complexity of quasiconvex integer minimization problem (Q2423784) (← links)
- On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems (Q2423820) (← links)
- Variable neighborhood search for stochastic linear programming problem with quantile criterion (Q2423821) (← links)
- Determining the interset distance (Q2424812) (← links)
- On the existence of a trivariate copula with given values of a trivariate quasi-copula at several points (Q2445557) (← links)
