The following pages link to (Q4040221):
Displaying 50 items.
- The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity (Q256627) (← links)
- The generalized assignment problem with minimum quantities (Q257215) (← links)
- Implicit cover inequalities (Q266036) (← links)
- Improving branch-and-cut performance by random sampling (Q266414) (← links)
- Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem (Q271978) (← links)
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
- A mixed integer programming approach to multi-skilled workforce scheduling (Q283273) (← links)
- Dynamic programming approximation algorithms for the capacitated lot-sizing problem (Q288224) (← links)
- Decomposition and mean-field approach to mixed integer optimal compensation problems (Q289132) (← links)
- Total variation bounds on the expectation of periodic functions with applications to recourse approximations (Q291034) (← links)
- Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs (Q291039) (← links)
- Cutting planes for the multistage stochastic unit commitment problem (Q291049) (← links)
- An implicit enumeration algorithm for the passenger service planning problem: application to the Taiwan railways administration line (Q296903) (← links)
- Asymptotic independence of servers' activity in queueing systems with limited resource pooling (Q298169) (← links)
- Optimization-based heuristics for underground mine scheduling (Q299816) (← links)
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
- Double system parts optimization: static and dynamic model (Q301482) (← links)
- Local convex hulls for a special class of integer multicommodity flow problems (Q301702) (← links)
- Solving disjunctive optimization problems by generalized semi-infinite optimization techniques (Q301738) (← links)
- Estimating the strength of poker hands by integer linear programming techniques (Q301942) (← links)
- A polyhedral study of production ramping (Q304233) (← links)
- Duality for mixed-integer convex minimization (Q304264) (← links)
- A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations (Q309061) (← links)
- Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets (Q312703) (← links)
- On sublinear inequalities for mixed integer conic programs (Q312706) (← links)
- A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern (Q319599) (← links)
- Multi-level facility location as the maximization of a submodular set function (Q320143) (← links)
- Aggregation heuristic for the open-pit block scheduling problem (Q321137) (← links)
- Supplier selection in the processed food industry under uncertainty (Q322981) (← links)
- An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters (Q323016) (← links)
- An integer programming approach for solving the \(p\)-dispersion problem (Q323154) (← links)
- Allocation of flows in closed bipartite queueing networks (Q323531) (← links)
- An implementation of exact knapsack separation (Q330511) (← links)
- Revising history for cost-informed process improvement (Q335888) (← links)
- Impact of fairness and heterogeneity on delays in large-scale centralized content delivery systems (Q335907) (← links)
- A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders (Q336386) (← links)
- A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem (Q336528) (← links)
- Solving quality control problems with an algorithm for minimax programs with coupled constraints (Q336795) (← links)
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem (Q337120) (← links)
- Integer programming methods for large-scale practical classroom assignment problems (Q337258) (← links)
- Modelling and planning public cultural schedules for efficient use of resources (Q337501) (← links)
- A two-phase adaptive variable neighborhood approach for nurse rostering (Q337577) (← links)
- \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis (Q337587) (← links)
- Two-stage stochastic programming supply chain model for biodiesel production via wastewater treatment (Q342004) (← links)
- Optimizing experimental design in genetics (Q353179) (← links)
- Alternative formulations for the set packing problem and their application to the winner determination problem (Q367639) (← links)
- A branch-and-cut algorithm for the maximum benefit Chinese postman problem (Q378087) (← links)
- Shrinking of time Petri nets (Q378906) (← links)
- Reconstructing convex matrices by integer programming approaches (Q387306) (← links)
- The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect (Q403365) (← links)
