scientific article; zbMATH DE number 1234104
From MaRDI portal
Publication:4221106
Cited in
(only showing first 100 items - show all)- Stability of associated primes of integral closures of monomial ideals
- Blowup algebras of square-free monomial ideals and some links to combinatorial optimization problems
- Integral cycle bases for cyclic timetabling
- Integer program with bimodular matrix
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls
- On the representability of totally unimodular matrices on bidirected graphs
- The iterative step in the linear programming algorithm of N. Karmarkar
- Pivot rules for linear programming: A survey on recent theoretical developments
- Orienting rewrite rules with the Knuth-Bendix order.
- Linear programming, complexity. Separation and optimization.
- Novel results for the anisotropic sparse grid quadrature
- Staircase compatibility and its applications in scheduling and piecewise linearization
- Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling
- On minimising the maximum expected verification time
- On the use of independent base-stock policies in assemble-to-order inventory systems with nonidentical lead times
- Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling
- Stability of depth and Cohen-Macaulayness of integral closures of powers of monomial ideals
- Characterization of copulas with given diagonal and opposite diagonal sections
- A multi-objective interpretation of optimal transport
- Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach
- Improved approximation algorithms for capacitated fault-tolerant \(k\)-center
- A \(\min\)-\(\max\) relation in flowgraphs and some applications
- FPT-algorithms for some problems related to integer programming
- Piercing axis-parallel boxes
- Optimal service order for mass-casualty incident response
- Integer programming for urban design
- Complexity of necessary efficiency in interval linear programming and multiobjective linear programming
- A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set
- On characterization of the core of lane covering games via dual solutions
- Regularity of powers of cover ideals of unimodular hypergraphs
- Total dual integrality and integral solutions of the linear complementarity problem
- Optimal codon randomization via mathematical programming
- Reduction techniques for network validation in systems biology
- A hybrid method for modeling and solving supply chain optimization problems with soft and logical constraints
- The stable b-matching polytope revisited
- On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic
- Toric sets and orbits on toric varieties.
- Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks
- Inhomogeneous extreme forms
- On the geometry of discrete exponential families with application to exponential random graph models
- Simple games versus weighted voting games: bounding the critical threshold value
- Constructions of copulas with given diagonal (and opposite diagonal) sections and some generalizations
- Flexible resource allocation to interval jobs
- Facets of the cone of totally balanced games
- Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1]
- Maximum flows in generalized processing networks
- An efficient algorithm for deciding vanishing of Schubert polynomial coefficients
- Polyhedral approximations of the semidefinite cone and their application
- Equilibrium strategies for multiple interdictors on a common network
- Oriented graphs determined by their generalized skew spectrum
- An arithmetic criterion for graphs being determined by their generalized \(A_\alpha \)-spectra
- Classification of triples of lattice polytopes with a given mixed volume
- Polyhedral circuits and their applications
- Regularity and Koszul property of symbolic powers of monomial ideals
- Black-box combinatorial optimization using models with integer-valued minima
- On the optimal correction of infeasible systems of linear inequalities
- A new concave minimization algorithm for the absolute value equation solution
- Algorithmic reduction of biological networks with multiple time scales
- Analyzing unit read-once refutations in difference constraint systems
- Critical subsystems in time interval models. Application to a baking process
- A pseudo-linear time algorithm for the optimal discrete speed minimizing energy consumption
- The Schrijver system of the flow cone in series-parallel graphs
- Charging station optimization for balanced electric car sharing
- The continuous maximum capacity path interdiction problem
- Improved analysis of online balanced clustering
- Finitely generated structures computable in polynomial time
- Smith normal form and the generalized spectral characterization of graphs
- Flexible proof production in an industrial-strength SMT solver
- An efficient subsumption test pipeline for BS(LRA) clauses
- Nonlinear desirability as a linear classification problem
- An FPTAS for the -modular multidimensional knapsack problem
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
- About the complexity of two-stage stochastic IPs
- Facets of the cone of exact games
- Solving \((k-1)\)-stable instances of \texttt{k-terminal cut} with isolating cuts
- Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty
- A determinantal formula for circuits of integer lattices
- Deformations of dimer models
- On dominating set of some subclasses of string graphs
- Fast and efficient bit-level precision tuning
- A unified reproducing kernel gradient smoothing Galerkin meshfree approach to strain gradient elasticity
- On lattice point counting in -modular polyhedra
- How to find the convex hull of all integer points in a polyhedron?
- Polarization in cooperative networks through optimal placement of informed agents
- A regularity result for shortest generalized billiard trajectories in convex bodies in \(\mathbb{R}^n\)
- Total dual dyadicness and dyadic generating sets
- An inherently consistent reproducing kernel gradient smoothing framework toward efficient Galerkin meshfree formulation with explicit quadrature
- Subset selection for multiple linear regression via optimization
- \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited
- On compatible triangulations with a minimum number of Steiner points
- Symmetry of eigenvalues of Sylvester matrices and tensors
- On mean values of multivariable complex valued multiplicative functions and applications
- Mixed-integer bilevel representability
- A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem
- Type and conductor of simplicial affine semigroups
- GKZ-hypergeometric systems for Feynman integrals
- The main vertices of a star set and related graph parameters
- Tree-like unit refutations in Horn constraint systems
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
- Quantum violation of the suppes-zanotti inequalities and ``contextuality
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4221106)
