The following pages link to John Martinovic (Q510432):
Displaying 23 items.
- (Q322685) (redirect page) (← links)
- Integer linear programming models for the skiving stock problem (Q322686) (← links)
- The proper relaxation and the proper gap of the skiving stock problem (Q510433) (← links)
- The skiving stock problem and its relation to hypergraph matchings (Q1662646) (← links)
- Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case (Q1730578) (← links)
- Integer rounding and modified integer rounding for the skiving stock problem (Q1751167) (← links)
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems (Q1754107) (← links)
- Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201) (← links)
- An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case (Q2012070) (← links)
- Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles (Q2042074) (← links)
- Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups (Q2080827) (← links)
- An introduction to stochastic bin packing-based server consolidation with conflicts (Q2146367) (← links)
- Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727) (← links)
- Mathematical models and approximate solution approaches for the stochastic bin packing problem (Q2669539) (← links)
- LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gap (Q4596192) (← links)
- On the Solution of Generalized Spectrum Allocation Problems (Q4596453) (← links)
- Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory (Q4646531) (← links)
- An Improved Upper Bound for the Gap of Skiving Stock Instances of the Divisible Case (Q4685755) (← links)
- A Computational Study of Reduction Techniques for the Minimum Connectivity Inference Problem (Q5114944) (← links)
- An improved flow-based formulation and reduction principles for the minimum connectivity inference problem (Q5197998) (← links)
- A combinatorial flow-based formulation for temporal bin packing problems (Q6109803) (← links)
- Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model (Q6157429) (← links)
- Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups (Q6491686) (← links)
