scientific article; zbMATH DE number 4089320
From MaRDI portal
Publication:3818127
Recommendations
Cited in
(only showing first 100 items - show all)- Preemptive scheduling and antichain polyhedra
- Predictive control for hybrid systems. Implications of polyhedral pre-computations
- The box-TDI system associated with 2-edge connected spanning subgraphs
- Cayley sum graphs and eigenvalues of \((3,6)\)-fullerenes
- Geometry and complexity of O'Hara's algorithm
- Optimal search for rationals
- Integral analysis method - IAM
- Cardinality constrained and multicriteria (multi)cut problems
- A robust APTAS for the classical bin packing problem
- Packing circuits in matroids
- On threshold BDDs and the optimal variable ordering problem
- Red-blue covering problems and the consecutive ones property
- The cone of balanced subgraphs
- Polygons with inscribed circles and prescribed side lengths
- Minimum fractional dominating functions and maximum fractional packing functions
- Circular choosability is rational
- Disjoint congruence classes and a timetabling application
- A new constraint-based description of the steady-state flux cone of metabolic networks
- Probabilistic weak simulation is decidable in polynomial time
- Scheduling multiprocessor UET tasks of two sizes
- A superclass of edge-path-tree graphs with few cliques
- Efficient Craig interpolation for linear Diophantine (dis)equations and linear modular equations
- Graphs of transportation polytopes
- Ehrhart polynomials of matroid polytopes and polymatroids
- The mixing set with divisible capacities: a simple approach
- Integrality properties of edge path tree families
- Easy intruder deduction problems with homomorphisms
- Polyhedral proof methods in combinatorial optimization
- The Schrijver system of odd join polyhedra
- Recognizing max-flow min-cut path matrices
- Finding a partial solution to a linear system of equations in positive integers
- Some remarks on Karmarkar's potential function
- Generalized polymatroids and submodular flows
- A note on the traveling salesman problem
- The diophantine problem of Frobenius: A close bound
- Solution of parametrized linear inequalities by Fourier elimination and its applications
- Efficient solution of linear diophantine equations
- A cutting plane algorithm for a clustering problem
- A short proof of Tutte's characterization of totally unimodular matrices
- On cutting-plane proofs in combinatorial optimization
- A polynomial-time algorithm for a class of linear complementarity problems
- Scalings of matrices which have prespecified row sums and column sums via optimization
- Generalized scalings satisfying linear equations
- Foundations of aggregation constraints
- Affine scheduling on bounded convex polyhedric domains is asymptotically optimal
- A dual projective simplex method for linear programming
- Multi-criteria analysis with partial information about the weighting coefficients
- Elementary divisors of graphs and matroids
- A class of invariant regulators for the discrete-time linear constrained regulation problem
- Global convergence of the affine scaling methods for degenerate linear programming problems
- An interior point algorithm to solve computationally difficult set covering problems
- The symbiotic relationship of combinatorics and matrix theory
- Traveling salesman games
- Induced binary probabilities and the linear ordering polytope: A status report
- Expressing combinatorial optimization problems by linear programs
- A canonical form for generalized linear constraints
- The distance to a polyhedron
- Optimal partitions having disjoint convex and conic hulls
- A geometric view of parametric linear programming
- On integer points in polyhedra
- Generalized transitive tournaments and doubly stochastic matrices
- Lattice translates of a polytope and the Frobenius problem
- Coflow polyhedra
- Generalization of Karmarkar's algorithm to convex homogeneous functions
- On interior algorithms for linear programming with no regularity assumptions
- A note on approximate linear programming
- Matching theory -- a sampler: From Dénes König to the present
- Circuits in graphs embedded on the torus
- A characterization of the uncapacitated network design polytope
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
- A decomposition theory for matroids. VII: Analysis of minimal violation matrices
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- Probabilistic logic programming
- Lattice matrices, intersection of ring families and dicuts
- On polynomial solvability of the high multiplicity total weighted tardiness problem
- Note on lattice-point-free convex bodies
- A computational basis for higher-dimensional computational geometry and applications
- A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
- LP relaxation of the two dimensional knapsack problem with box and GUB constraints
- Polytopes related to the \(l_{\infty}\)-distance between vectors
- Stability aspects of the traveling salesman problem based on \(k\)-best solutions
- Adjacency on the constrained assignment problem
- More tight monomials in quantized enveloping algebras
- The optimal path-matching problem
- On the stochastic independence properties of hard-core distributions
- The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable
- On packing connectors
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- A note on formulations for the A-partition problem on hypergraphs
- On the invariance of solutions of finite games
- A cutting-plane approach to mixed 0-1 stochastic integer programs
- The complexity of multidimensional periodic scheduling
- On the complexity of smooth projective toric varieties
- Algorithms for matrix groups and the Tits alternative
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
- Weak k-majorization and polyhedra
- Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces
- Discrete convex analysis
- Standard pairs and group relaxations in integer programming
- Using SAGBI bases to compute invariants
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 Q3818127)
