Pages that link to "Item:Q4221106"
From MaRDI portal
The following pages link to Theory of linear and integer programming. (Q4221106):
Displaying 50 items.
- On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic (Q1847145) (← links)
- Toric sets and orbits on toric varieties. (Q1874530) (← links)
- Streaming graph computations with a helpful advisor (Q1939657) (← links)
- Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks (Q1945076) (← links)
- Inhomogeneous extreme forms (Q1948155) (← links)
- On the geometry of discrete exponential families with application to exponential random graph models (Q1951987) (← links)
- Simple games versus weighted voting games: bounding the critical threshold value (Q1986594) (← links)
- Constructions of copulas with given diagonal (and opposite diagonal) sections and some generalizations (Q1994045) (← links)
- Flexible resource allocation to interval jobs (Q1999968) (← links)
- Facets of the cone of totally balanced games (Q2009181) (← links)
- Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1] (Q2010139) (← links)
- Maximum flows in generalized processing networks (Q2012883) (← links)
- An efficient algorithm for deciding vanishing of Schubert polynomial coefficients (Q2020382) (← links)
- Polyhedral approximations of the semidefinite cone and their application (Q2028478) (← links)
- Equilibrium strategies for multiple interdictors on a common network (Q2028891) (← links)
- Oriented graphs determined by their generalized skew spectrum (Q2029879) (← links)
- An arithmetic criterion for graphs being determined by their generalized \(A_\alpha \)-spectra (Q2032894) (← links)
- Classification of triples of lattice polytopes with a given mixed volume (Q2039312) (← links)
- Polyhedral circuits and their applications (Q2039640) (← links)
- Regularity and Koszul property of symbolic powers of monomial ideals (Q2043083) (← links)
- Black-box combinatorial optimization using models with integer-valued minima (Q2043440) (← links)
- On the optimal correction of infeasible systems of linear inequalities (Q2046550) (← links)
- A new concave minimization algorithm for the absolute value equation solution (Q2047210) (← links)
- Algorithmic reduction of biological networks with multiple time scales (Q2051597) (← links)
- Analyzing unit read-once refutations in difference constraint systems (Q2055789) (← links)
- Critical subsystems in time interval models. Application to a baking process (Q2058486) (← links)
- A pseudo-linear time algorithm for the optimal discrete speed minimizing energy consumption (Q2058559) (← links)
- The Schrijver system of the flow cone in series-parallel graphs (Q2064292) (← links)
- Charging station optimization for balanced electric car sharing (Q2064295) (← links)
- The continuous maximum capacity path interdiction problem (Q2083925) (← links)
- Improved analysis of online balanced clustering (Q2085752) (← links)
- Finitely generated structures computable in polynomial time (Q2088618) (← links)
- Smith normal form and the generalized spectral characterization of graphs (Q2092406) (← links)
- Flexible proof production in an industrial-strength SMT solver (Q2104495) (← links)
- An efficient subsumption test pipeline for BS(LRA) clauses (Q2104505) (← links)
- Nonlinear desirability as a linear classification problem (Q2105588) (← links)
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint (Q2118096) (← links)
- About the complexity of two-stage stochastic IPs (Q2118129) (← links)
- Facets of the cone of exact games (Q2123120) (← links)
- Solving \((k-1)\)-stable instances of \texttt{k-terminal cut} with isolating cuts (Q2125213) (← links)
- Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty (Q2125227) (← links)
- A determinantal formula for circuits of integer lattices (Q2130938) (← links)
- Deformations of dimer models (Q2134576) (← links)
- On dominating set of some subclasses of string graphs (Q2144448) (← links)
- Fast and efficient bit-level precision tuning (Q2145313) (← links)
- A unified reproducing kernel gradient smoothing Galerkin meshfree approach to strain gradient elasticity (Q2150257) (← links)
- On lattice point counting in \(\varDelta\)-modular polyhedra (Q2162684) (← links)
- How to find the convex hull of all integer points in a polyhedron? (Q2162699) (← links)
- Polarization in cooperative networks through optimal placement of informed agents (Q2164272) (← links)
