The following pages link to Geir Dahl (Q201951):
Displaying 50 items.
- Njål Foldnes (Q107254) (← links)
- (Q107260) (redirect page) (← links)
- Zero sum sign-central matrices and applications (Q290660) (← links)
- (Q309114) (redirect page) (← links)
- Zero-one completely positive matrices and the \(\mathcal A(R, S)\) classes (Q309116) (← links)
- Majorization for partially ordered sets (Q393928) (← links)
- A matrix-based ranking method with application to tennis (Q417556) (← links)
- Martingale matrix classes and polytopes (Q445833) (← links)
- The Laplacian energy of threshold graphs and majorization (Q486231) (← links)
- Alternating sign matrices, extensions and related cones (Q515803) (← links)
- A note on permutations and rank aggregation (Q611777) (← links)
- Polytopes related to interval vectors and incidence matrices (Q636259) (← links)
- A note on hop-constrained walk polytopes. (Q703241) (← links)
- Majorization classes of integral matrices (Q763063) (← links)
- A tensor product matrix approximation problem in quantum physics (Q861038) (← links)
- LP based heuristics for the multiple knapsack problem with assignment restrictions (Q863573) (← links)
- Transportation matrices with staircase patterns and majorization (Q947648) (← links)
- Majorization permutahedra and (0,1)-matrices (Q968997) (← links)
- A note on a parameter relating traffic equilibria and system optimal routing (Q990457) (← links)
- Reconstructing (0,1)-matrices from projections using integer programming (Q1001203) (← links)
- Permutation matrices related to Sudoku (Q1014505) (← links)
- Disjoint congruence classes and a timetabling application (Q1026128) (← links)
- Polytopes related to the \(l_{\infty}\)-distance between vectors (Q1267189) (← links)
- Weak \(k\)-majorization and polyhedra (Q1290598) (← links)
- Matrix majorization (Q1300866) (← links)
- The 2-hop spanning tree problem (Q1306467) (← links)
- Directed Steiner problems with connectivity constraints (Q1315992) (← links)
- A polyhedral approach to multicommodity survivable network design (Q1338830) (← links)
- Majorization, polyhedra, and statistical testing problems (Q1379114) (← links)
- The doubly graded matrix cone and Ferrers matrices (Q1399239) (← links)
- Complete description of a class of knapsack polytopes. (Q1400340) (← links)
- On the directed hop-constrained shortest path problem (Q1433652) (← links)
- A note on diagonally dominant matrices (Q1587900) (← links)
- Majorization for matrix classes (Q1654396) (← links)
- Alternating sign matrices and hypermatrices, and a generalization of Latin squares (Q1693347) (← links)
- New bounds for the signless Laplacian spread (Q1736235) (← links)
- Combinatorial Perron parameters for trees (Q1736239) (← links)
- The \(k\)-regular induced subgraph problem (Q1786867) (← links)
- Notes on polyhedra associated with hop-constrained paths (Q1807932) (← links)
- Majorization-constrained doubly stochastic matrices (Q1863545) (← links)
- Some constrained partitioning problems and majorization (Q1876140) (← links)
- Tridiagonal doubly stochastic matrices (Q1886535) (← links)
- Majorization polytopes (Q1965282) (← links)
- A note on majorization transforms and Ryser's algorithm (Q2017186) (← links)
- Permutation matrices, their discrete derivatives and extremal properties (Q2022380) (← links)
- Convex \((0, 1)\)-matrices and their epitopes (Q2022503) (← links)
- The interval structure of \(( 0 , 1 )\)-matrices (Q2026313) (← links)
- Perron values and classes of trees (Q2074970) (← links)
- Sign-restricted matrices of 0's, 1's, and \(-1\)'s (Q2229510) (← links)
- The skeleton of acyclic Birkhoff polytopes (Q2250757) (← links)
