Mathematical Methods of Organizing and Planning Production
From MaRDI portal
Publication:2768992
DOI10.1287/mnsc.6.4.366zbMath0995.90532OpenAlexW2032938251MaRDI QIDQ2768992
Publication date: 22 October 2002
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: http://www.jstor.org/stable/2627082
Related Items
Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields, List-scheduling and column-generations for scheduling of n job-groups with set up time and due date through m identical parallel machines to minimize makespan, Asymptotics for Semidiscrete Entropic Optimal Transport, Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains, Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem, A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term, Hybrid heuristic for the production replanning problem under varying demands in manufacturing industries, Distributionally robust unsupervised domain adaptation, A distributional framework for evaluation, comparison and uncertainty quantification in soft clustering, Making decisions with evidential probability and objective Bayesian calibration inductive logics, Predicting turbulent dynamics with the convolutional autoencoder echo state network, Problem-driven scenario clustering in stochastic optimization, A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics, Bin Packing Problem with Time Lags, Operational Research: Milestones and Highlights of Canadian Contributions, Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry, A two-stage data envelopment analysis approach to solve extended transportation problem with non-homogenous costs, A combinatorial flow-based formulation for temporal bin packing problems, Moving from linear to conic markets for electricity, On quantum optimal transport, Nested \((2,3)\)-instances of the cutting stock problem, Concentration inequalities for kernel density estimators under uniform mixing, A one-dimensional puzzle to teach integer programming, Two-phase selection of representative contracts for valuation of large variable annuity portfolios, Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model, The cutting stock problem applied to the hardening process in an automotive spring factory, A solution technique for capacitated two-level hierarchical time minimization transportation problem, Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points, Uniform confidence band for optimal transport map on one-dimensional data, Unnamed Item, From High-Level Model to Branch-and-Price Solution in G12, An Iterative Solution Technique to Minimize the Average Transportation Cost of Capacitated Transportation Problem with Bounds on Rim Conditions, Zero-Sum Two Person Games, POINTWISE RESIDUAL METHOD FOR SOLVING PRIMAL AND DUAL ILL-POSED LINEAR PROGRAMMING PROBLEMS WITH APPROXIMATE DATA, A Multiple Perspective Approach to History of Mathematics: Mathematical Programming and Rashevsky’s Early Development of Mathematical Biology in the Twentieth Century, Unnamed Item, The multi-objective multi-item just-in-time transportation problem, Signposts and contributions of Leonid Kantorovich, Computing Large Market Equilibria Using Abstractions, A residual recombination heuristic for one-dimensional cutting stock problems, An analysis of the integrated lot-sizing and cutting-stock problem formulation, Time variant multi-objective linear fractional interval-valued transportation problem, Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem, On the effectivity of gradient methods for cutting stock problems, Coalitional Bargaining in Networks, Transportation problem with multi-choice cost and demand and stochastic supply, An introduction to stochastic bin packing-based server consolidation with conflicts, An iterative algorithm for two level hierarchical time minimization transportation problem, Integer linear programming models for the skiving stock problem, Bin packing and cutting stock problems: mathematical models and exact algorithms, Accelerating column generation for variable sized bin-packing problems, A two phase variable neighborhood search for the multi-product inventory routing problem, A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem, Solution approaches for the cutting stock problem with setup cost, Credit linked two-stage multi-objective transportation problem in rough and bi-rough environments, An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock, The skiving stock problem and its relation to hypergraph matchings, Multi-objective two-stage grey transportation problem using utility function with goals, One-dimensional stock cutting: optimization of usable leftovers in consecutive orders, Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost, The earliest contribution to location theory? Spatio-economic equilibrium with Lamé and Clapeyron, 1829, Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost, Heuristics for the integer one-dimensional cutting stock problem: A computational study, Simultaneously exploiting two formulations: an exact Benders decomposition approach, CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem, An approximation algorithm for solving unconstrained two-dimensional knapsack problems, Compact integer linear programming formulations for the temporal bin packing problem with fire-ups, Mathematical models and approximate solution approaches for the stochastic bin packing problem, Generalized hyper-heuristics for solving 2D regular and irregular packing problems, On the structure of optimal transportation plans between discrete measures, Shortest path and maximum flow problems in networks with additive losses and gains, A study on load-balanced variants of the bin packing problem, Fairness criteria for allocating scarce resources, The trim-loss and assortment problems: A survey, Manifold learning for coherent design interpolation based on geometrical and topological descriptors, Dantzig-Wolfe decomposition and branch-and-price solving in G12, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, Survey of the Theory of Extremal Problems, A two-phase support method for solving linear programs: numerical experiments, A new model for complete solutions to one-dimensional cutting stock problems., A Strongly Polynomial Algorithm for Generalized Flow Maximization, Bin packing can be solved within 1+epsilon in linear time, Linear optimization with bipolar max-min constraints, Misfit function for full waveform inversion based on the Wasserstein metric with dynamic formulation, Sustainable vegetable crop supply problem with perishable stocks, Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case, Cutting stock problems and solution procedures, Solving Large Scale Optimization Problems in the Transportation Industry and Beyond Through Column Generation, The big-M method with the numerical infinite \(M\), A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem, On LP relaxations for the pattern minimization problem, An exact model for a slitting problem in the steel industry, An improved approximation scheme for variable-sized bin packing, The proper relaxation and the proper gap of the skiving stock problem, Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory, Multi-objective geometric programming problem with \(\epsilon\)-constraint method, The double pivot simplex method, Packing problems, A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems, Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation, The usable leftover one‐dimensional cutting stock problem—a priority‐in‐use heuristic, Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem, Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost, The min-conflict packing problem, OSQP: An Operator Splitting Solver for Quadratic Programs, An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case, Sustainable vegetable crop supply problem, Optimal and heuristic solutions for a scheduling problem arising in a foundry, On the Pythagorean Structure of the Optimal Transport for Separable Cost Functions, Merging the local and global approaches to probabilistic satisfiability, A new fuzzy multi-objective programming: entropy based geometric programming and its application of transportation problems, Approximation algorithms for the transportation problem with market choice and related models, Classification and literature review of integrated lot-sizing and cutting stock problems, Aggregation of inputs and outputs prior to data envelopment analysis under big data, Solving bin packing problems using VRPSolver models, Algebraic solution of a problem of optimal project scheduling in project management, One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model, The maximum diversity assortment selection problem, Decomposition methods for the lot-sizing and cutting-stock problems in paper industries, Sensitive Instances of the Cutting Stock Problem, Two ways to define compatible metrics on the simplex of measures, A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems, The integrated lot sizing and cutting stock problem in an automotive spring factory, One infinite-step model of the Leontev type, An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing, The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems, A typology of cutting and packing problems, Optimal solutions for the cutting stock problem, Lagrange's interpolating polynomial approach to solve multi-choice transportation problem, Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups, New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems, Some facts related to the papers by L. V. Kantorovich reproduced in this issue, The Kantorovich metric: the initial history and little-known applications, The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price, Improved flow-based formulations for the skiving stock problem, Lagrange's principle in extremum problems with constraints, LP models for bin packing and cutting stock problems, A branch-and-price algorithm for the temporal bin packing problem, On compact formulations for integer programs solved by column generation
