Pages that link to "Item:Q2768992"

The following pages link to Mathematical Methods of Organizing and Planning Production (Q2768992):

Displaying 50 items.

• OSQP: An Operator Splitting Solver for Quadratic Programs (Q78613) (← links)
• On the Pythagorean Structure of the Optimal Transport for Separable Cost Functions (Q93069) (← links)
• Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem (Q297181) (← links)
• An iterative algorithm for two level hierarchical time minimization transportation problem (Q319851) (← links)
• Integer linear programming models for the skiving stock problem (Q322686) (← links)
• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• A two phase variable neighborhood search for the multi-product inventory routing problem (Q337230) (← links)
• Solution approaches for the cutting stock problem with setup cost (Q339571) (← links)
• Sustainable vegetable crop supply problem with perishable stocks (Q475237) (← links)
• An improved approximation scheme for variable-sized bin packing (Q504994) (← links)
• The proper relaxation and the proper gap of the skiving stock problem (Q510433) (← links)
• Generalized hyper-heuristics for solving 2D regular and irregular packing problems (Q610988) (← links)
• Shortest path and maximum flow problems in networks with additive losses and gains (Q620954) (← links)
• The double pivot simplex method (Q684156) (← links)
• Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
• Two ways to define compatible metrics on the simplex of measures (Q744534) (← links)
• On compact formulations for integer programs solved by column generation (Q817199) (← links)
• An analysis of the integrated lot-sizing and cutting-stock problem formulation (Q821771) (← links)
• A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (Q941555) (← links)
• An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing (Q1027566) (← links)
• New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
• The earliest contribution to location theory? Spatio-economic equilibrium with Lamé and Clapeyron, 1829 (Q1119557) (← links)
• CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem (Q1127211) (← links)
• An approximation algorithm for solving unconstrained two-dimensional knapsack problems (Q1127219) (← links)
• The trim-loss and assortment problems: A survey (Q1143942) (← links)
• Bin packing can be solved within 1+epsilon in linear time (Q1164429) (← links)
• Cutting stock problems and solution procedures (Q1178994) (← links)
• Packing problems (Q1197916) (← links)
• The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems (Q1278579) (← links)
• On the effectivity of gradient methods for cutting stock problems (Q1342431) (← links)
• An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock (Q1370660) (← links)
• A new model for complete solutions to one-dimensional cutting stock problems. (Q1417501) (← links)
• A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem (Q1652389) (← 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)
• A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems (Q1754107) (← links)
• The min-conflict packing problem (Q1761135) (← links)
• Optimal and heuristic solutions for a scheduling problem arising in a foundry (Q1772868) (← links)
• Approximation algorithms for the transportation problem with market choice and related models (Q1785305) (← links)
• A typology of cutting and packing problems (Q1825761) (← links)
• Optimal solutions for the cutting stock problem (Q1825768) (← links)
• LP models for bin packing and cutting stock problems (Q1847189) (← links)
• Heuristics for the integer one-dimensional cutting stock problem: A computational study (Q1919356) (← links)
• A two-phase support method for solving linear programs: numerical experiments (Q1954826) (← links)
• Multi-objective geometric programming problem with \(\epsilon\)-constraint method (Q1991380) (← links)
• Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201) (← links)
• Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem (Q2003574) (← links)
• Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost (Q2003581) (← links)
• An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case (Q2012070) (← links)
• Solving bin packing problems using VRPSolver models (Q2033390) (← links)