Pages that link to "Item:Q4221106"
From MaRDI portal
The following pages link to Theory of linear and integer programming. (Q4221106):
Displaying 50 items.
- Properties of Gomory-Hu co-cycle bases (Q764362) (← links)
- Fields of algebraic numbers computable in polynomial time. I (Q784464) (← links)
- Robust approach to restricted items selection problem (Q828685) (← links)
- On the copy complexity of width 3 Horn constraint systems (Q831922) (← links)
- Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs (Q832719) (← links)
- Truthful mechanism design for multidimensional scheduling via cycle monotonicity (Q834857) (← links)
- On seminormal monoid rings (Q852679) (← links)
- Cycles and communicating classes in membrane systems and molecular dynamics (Q872209) (← links)
- Highly sparse representations from dictionaries are unique and independent of the sparseness measure (Q877577) (← links)
- A quantifier-elimination based heuristic for automatically generating inductive assertions for programs (Q882517) (← links)
- An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty (Q892228) (← links)
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272) (← links)
- The power of pyramid decomposition in Normaliz (Q898277) (← links)
- The coherence of Łukasiewicz assessments is NP-complete (Q985139) (← links)
- Optimal admissible composition of abstraction heuristics (Q991018) (← links)
- Stability of associated primes of integral closures of monomial ideals (Q1003620) (← links)
- Blowup algebras of square-free monomial ideals and some links to combinatorial optimization problems (Q1011130) (← links)
- Integral cycle bases for cyclic timetabling (Q1013300) (← links)
- Integer program with bimodular matrix (Q1015329) (← links)
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls (Q1040040) (← links)
- On the representability of totally unimodular matrices on bidirected graphs (Q1044979) (← links)
- The iterative step in the linear programming algorithm of N. Karmarkar (Q1089252) (← links)
- Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
- Orienting rewrite rules with the Knuth-Bendix order. (Q1401932) (← links)
- Linear programming, complexity. Separation and optimization. (Q1612911) (← links)
- Novel results for the anisotropic sparse grid quadrature (Q1635840) (← links)
- Staircase compatibility and its applications in scheduling and piecewise linearization (Q1662653) (← links)
- Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling (Q1663138) (← links)
- On minimising the maximum expected verification time (Q1675917) (← links)
- On the use of independent base-stock policies in assemble-to-order inventory systems with nonidentical lead times (Q1694767) (← links)
- Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling (Q1694842) (← links)
- Stability of depth and Cohen-Macaulayness of integral closures of powers of monomial ideals (Q1696180) (← links)
- Characterization of copulas with given diagonal and opposite diagonal sections (Q1699334) (← links)
- A multi-objective interpretation of optimal transport (Q1706409) (← links)
- Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach (Q1730665) (← links)
- Improved approximation algorithms for capacitated fault-tolerant \(k\)-center (Q1742378) (← links)
- A \(\min\)-\(\max\) relation in flowgraphs and some applications (Q1752483) (← links)
- FPT-algorithms for some problems related to integer programming (Q1752617) (← links)
- Piercing axis-parallel boxes (Q1753044) (← links)
- Optimal service order for mass-casualty incident response (Q1753583) (← links)
- Integer programming for urban design (Q1755415) (← links)
- Complexity of necessary efficiency in interval linear programming and multiobjective linear programming (Q1758029) (← links)
- A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set (Q1785240) (← links)
- On characterization of the core of lane covering games via dual solutions (Q1785295) (← links)
- Regularity of powers of cover ideals of unimodular hypergraphs (Q1786458) (← links)
- Total dual integrality and integral solutions of the linear complementarity problem (Q1790478) (← links)
- Optimal codon randomization via mathematical programming (Q1790735) (← links)
- Reduction techniques for network validation in systems biology (Q1790877) (← links)
- A hybrid method for modeling and solving supply chain optimization problems with soft and logical constraints (Q1792697) (← links)
- The stable \(b\)-matching polytope revisited (Q1801060) (← links)
