The following pages link to Shmuel Onn (Q314826):
Displaying 50 items.
- Optimization over Young diagrams (Q2052821) (← links)
- Matching orderable and separable hypergraphs (Q2136876) (← links)
- The complexity of vector partition (Q2155634) (← links)
- On line sum optimization (Q2228118) (← links)
- On the complexity of Hilbert refutations for partition (Q2252121) (← links)
- Huge multiway table problems (Q2339833) (← links)
- Convex integer optimization by constantly many linear counterparts (Q2451653) (← links)
- Markov bases of three-way tables are arbitrarily complicated (Q2457324) (← links)
- The use of edge-directions and linear programming to enumerate vertices (Q2471066) (← links)
- Permutohedra and minimal matrices (Q2576235) (← links)
- Minimal average degree aberration and the state polytope for experimental designs (Q2634804) (← links)
- Parametric nonlinear discrete optimization over well-described sets and matroid intersections (Q2638368) (← links)
- On degree sequence optimization (Q2661577) (← links)
- Optimization over degree sequences of graphs (Q2663988) (← links)
- Parameterized complexity of configuration integer programs (Q2670456) (← links)
- Approximate separable multichoice optimization over monotone systems (Q2673246) (← links)
- Separable and equatable hypergraphs (Q2696627) (← links)
- The Vector Partition Problem for Convex Objective Functions (Q2757683) (← links)
- Theory and Applications of n-Fold Integer Programming (Q2897311) (← links)
- (Q2928711) (← links)
- Approximate Nonlinear Optimization over Weighted Independence Systems (Q3058525) (← links)
- Accuracy Certificates for Computational Problems with Convex Structure (Q3169082) (← links)
- Nonlinear Matroid Optimization and Experimental Design (Q3393425) (← links)
- Huge Unimodular $n$-Fold Programs (Q3455242) (← links)
- Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz (Q3552513) (← links)
- Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz – Corrigendum (Q3557531) (← links)
- Nonlinear Optimization over a Weighted Independence System (Q3638454) (← links)
- On the Geometry and Computational Complexity of Radon Partitions in the Iinteger Lattice (Q3979444) (← links)
- Approximating Oracle Machines for Combinatorial Optimization (Q4294748) (← links)
- A Note on Lattice Simplices and Toric Varieties (Q4318101) (← links)
- A Colorful Determinantal Identity, a Conjecture of Rota, and Latin Squares (Q4340680) (← links)
- (Q4352311) (← links)
- Colourful Linear Programming and its Relatives (Q4361784) (← links)
- Convex Matroid Optimization (Q4443135) (← links)
- Explicit solution of partitioning problems over a 1-dimensional parameter space (Q4519922) (← links)
- Optimization over Degree Sequences (Q4579955) (← links)
- Colourful linear programming (Q4645909) (← links)
- The Complexity of Three-Way Statistical Tables (Q4651494) (← links)
- A Polynomial Time Algorithm for Shaped Partition Problems (Q4702337) (← links)
- (Q4761958) (← links)
- Automated Transformations for PDE Systems with Application to Multigrid Solvers (Q4785953) (← links)
- Social network coordination and graph routing (Q4797947) (← links)
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs (Q5002764) (← links)
- (Q5071029) (← links)
- Oriented matroid polytopes and polyhedral fans are signable (Q5101416) (← links)
- Hypergraphic Degree Sequences are Hard (Q5207882) (← links)
- Integer Programming and Combinatorial Optimization (Q5712465) (← links)
- All Linear and Integer Programs Are Slim 3‐Way Transportation Programs (Q5757350) (← links)
- Parameterized shifted combinatorial optimization (Q5915595) (← links)
- Cutting corners (Q5916326) (← links)
