The following pages link to Thomas Kalinowski (Q291042):
Displaying 46 items.
- Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming (Q291043) (← links)
- Incremental network design with shortest paths (Q296857) (← links)
- Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period (Q326488) (← links)
- A reclaimer scheduling problem arising in coal stockyard management (Q341465) (← links)
- Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies (Q342075) (← links)
- Scheduling arc maintenance jobs in a network to maximize total flow over time (Q406493) (← links)
- A polynomially solvable case of the pooling problem (Q513170) (← links)
- Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions (Q517317) (← links)
- New multi-commodity flow formulations for the pooling problem (Q524906) (← links)
- Incremental network design with maximum flows (Q726224) (← links)
- Extended formulations for convex hulls of some bilinear functions (Q783025) (← links)
- The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence (Q1026111) (← links)
- Maximal flat antichains of minimum weight (Q1028854) (← links)
- On the power domination number of de Bruijn and Kautz digraphs (Q1642708) (← links)
- Scheduling reclaimers serving a stock pad at a coal terminal (Q1707674) (← links)
- Zero forcing in iterated line digraphs (Q1727740) (← links)
- A lower bound on the zero forcing number (Q1801082) (← links)
- Maximal antichains of minimum size (Q1953477) (← links)
- Scheduling of maintenance windows in a mining supply chain rail network (Q2289897) (← links)
- A dual of the rectangle-segmentation problem for binary matrices (Q2380244) (← links)
- Minimum rank and zero forcing number for butterfly networks (Q2424660) (← links)
- A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint (Q2576341) (← links)
- Minimum weight flat antichains of subsets (Q2665830) (← links)
- Minimizing the regularity of maximal regular antichains of 2- and 3-sets (Q2800779) (← links)
- Reducing the tongue-and-groove underdosage in MLC shape matrix decomposition (Q2867352) (← links)
- Approximated MLC shape matrix decomposition with interleaf collision constraint (Q2867361) (← links)
- Incremental Network Design with Minimum Spanning Trees (Q2971398) (← links)
- A minimum cost flow formulation for approximated MLC segmentation (Q3082602) (← links)
- Realization of intensity modulated radiation fields using multileaf collimator (Q3439275) (← links)
- Optimization of Multi-Threshold Circuits (Q3439526) (← links)
- (Q4576211) (← links)
- The metric dimension of the circulant graph $C(n,\pm\{1,2,3,4\})$ (Q4595672) (← links)
- $H$-supermagic labelings for firecrackers, banana trees and flowers (Q4595674) (← links)
- The Zero Forcing Number of Graphs (Q4610449) (← links)
- Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results (Q4639695) (← links)
- Feasible Bases for a Polytope Related to the Hamilton Cycle Problem (Q5026442) (← links)
- Cube-magic labelings of grids (Q5033181) (← links)
- Hamiltonian Cycles and Subsets of Discounted Occupational Measures (Q5119853) (← links)
- (Q5483561) (← links)
- Realization of Intensity Modulated Radiation Fields Using Multileaf Collimators (Q5504242) (← links)
- Total Edge Irregularity Strength of the Cartesian Product of Bipartite Graphs and Paths (Q6154166) (← links)
- On the power domination number of de Bruijn and Kautz digraphs (Q6280522) (← links)
- Minimum Weight Flat Antichains of Subsets (Q6285036) (← links)
- Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes (Q6304346) (← links)
- Independent domination in the graph defined by two consecutive levels of the $n$-cube (Q6458690) (← links)
- Independent domination in the graph defined by two consecutive levels of the \(n\)-cube (Q6611017) (← links)
