On the public citation graph
Facets and algorithms for capacitated lot sizing
0 signed · 179 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/9781118627372openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.1002/nav.3800080104openalex-snapshot
Fixed‐cost transportation problems
inferredcites →https://doi.org/10.1002/nav.3800140110openalex-snapshot
An approximate solution method for the fixed charge problem
inferredcites →https://doi.org/10.1002/nav.3800150212openalex-snapshot
Multi‐product production scheduling via extreme point properties of linear programming
inferredcites →https://doi.org/10.1002/nav.3800160311openalex-snapshot
An approximative algorithm for the fixed charge problem
inferredcites →https://doi.org/10.1007/978-3-642-82450-0_3openalex-snapshot
LP-Based Combinatorial Problem Solving
inferredcites →https://doi.org/10.1007/bf01580121openalex-snapshot
On the facial structure of set packing polyhedra
inferredcites →https://doi.org/10.1007/bf01580222openalex-snapshot
Properties of vertex packing and independence system polyhedra
inferredcites →https://doi.org/10.1007/bf01580738openalex-snapshot
Lot-size models with backlogging: Strong reformulations and cutting planes
inferredcites →https://doi.org/10.1007/bf01582010openalex-snapshot
Facets of the linear ordering polytope
inferredcites →https://doi.org/10.1007/bf01582116openalex-snapshot
On the symmetric travelling salesman problem I: Inequalities
inferredcites →https://doi.org/10.1007/bf01582117openalex-snapshot
On the symmetric travelling salesman problem II: Lifting theorems and facets
inferredcites →https://doi.org/10.1007/bf01583779openalex-snapshot
Some facets of the simple plant location polytope
inferredcites →https://doi.org/10.1007/bf01584376openalex-snapshot
Solving matching problems with linear programming
inferredcites →https://doi.org/10.1007/bf01587093openalex-snapshot
Valid inequalities and facets of the capacitated plant location problem
inferredcites →https://doi.org/10.1007/bf02022040openalex-snapshot
Lp-based combinatorial problem solving
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1007/bf02592077openalex-snapshot
LP extreme points and cuts for the fixed-charge network design problem
inferredcites →https://doi.org/10.1007/bfb0120888openalex-snapshot
On the symmetric travelling salesman problem: A computational study
inferredcites →https://doi.org/10.1007/bfb0121006openalex-snapshot
Uncapacitated lot-sizing: The convex hull of solutions
inferredcites →https://doi.org/10.1007/bfb0121051openalex-snapshot
On the facial structure of scheduling polyhedra
inferredcites →https://doi.org/10.1016/0012-365x(73)90167-2openalex-snapshot
Edmonds polytopes and a hierarchy of combinatorial problems
inferredcites →https://doi.org/10.1016/0012-365x(75)90077-1openalex-snapshot
A class of facet producing graphs for vertex packing polyhedra
inferredcites →https://doi.org/10.1016/0095-8956(75)90041-6openalex-snapshot
On certain polytopes associated with graphs
inferredcites →https://doi.org/10.1016/0167-6377(87)90002-2openalex-snapshot
Optimization of a 532-city symmetric traveling salesman problem by branch and cut
inferredcites →https://doi.org/10.1016/0167-6377(88)90076-4openalex-snapshot
Valid inequalities and separation for capacitated economic lot sizing
inferredcites →https://doi.org/10.1016/0167-6377(90)90031-yopenalex-snapshot
Optimization of a 532-city symmetric traveling salesman problem by branch and cut
inferredcites →https://doi.org/10.1016/0272-6963(81)90033-4openalex-snapshot
A heuristic solution procedure for the multi‐item, single‐level, limited capacity, lot‐sizing problem
inferredcites →https://doi.org/10.1016/0377-2217(78)90109-1openalex-snapshot
A capacity constrained single-facility dynamic lot-size model
inferredcites →https://doi.org/10.1016/0377-2217(82)90176-xopenalex-snapshot
Worst case performance for lot sizing heuristics
inferredcites →https://doi.org/10.1016/0378-4754(86)90100-xopenalex-snapshot
Combinatorial optimization: Annotated bibliographies.
inferredcites →https://doi.org/10.1016/s0167-5060(08)70831-8openalex-snapshot
Covering, Packing and Knapsack Problems
inferredcites →https://doi.org/10.1057/jors.1979.251openalex-snapshot
Decision Systems for Inventory Management and Production Planning
inferredcites →https://doi.org/10.1080/05695557908974478openalex-snapshot
Heuristic Procedures for the Single Operation, Multi-Item Loading Problem
inferredcites →https://doi.org/10.1080/05695558108974565openalex-snapshot
The Dynamic Lot-Sizing Problem for Multiple Items Under Limited Capacity
inferredcites →https://doi.org/10.1080/07408178608975338openalex-snapshot
Multi Item Single Level Capacitated Dynamic Lotsizing Heuristics: A Computational Comparison (Part I: Static Case)
inferredcites →https://doi.org/10.1080/07408178608975339openalex-snapshot
Multi Item Single Level Capacitated Dynamic Lotsizing Heuristics: A Computational Comparison (Part II: Rolling Horizon)
inferredcites →https://doi.org/10.1137/0211053openalex-snapshot
On Linear Characterizations of Combinatorial Optimization Problems
inferredcites →https://doi.org/10.1159/000273299openalex-snapshot
Der Saccus endolymphaticus bei Entzündungsprozessen
inferredcites →https://doi.org/10.1287/mnsc.10.3.465openalex-snapshot
Some Generalizations of an Inventory Planning Horizon Theorem
inferredcites →https://doi.org/10.1287/mnsc.1040.0262openalex-snapshot
Dynamic Version of the Economic Lot Size Model
inferredcites →https://doi.org/10.1287/mnsc.11.9.874openalex-snapshot
Optimal Programming of Lot Sizes, Inventory and Labor Allocations
inferredcites →https://doi.org/10.1287/mnsc.13.1.105openalex-snapshot
A Deterministic Multi-Period Production Scheduling Model with Backlogging
inferredcites →https://doi.org/10.1287/mnsc.15.5.268openalex-snapshot
Extensions of the Planning Horizon Theorem in the Dynamic Lot Size Model
inferredcites →https://doi.org/10.1287/mnsc.15.9.506openalex-snapshot
A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
inferredcites →https://doi.org/10.1287/mnsc.16.1.67openalex-snapshot
A Branch-and-Bound Algorithm for Multi-Level Fixed-Charge Problems
inferredcites →https://doi.org/10.1287/mnsc.18.1.12openalex-snapshot
Deterministic Production Planning with Concave Costs and Capacity Constraints
inferredcites →https://doi.org/10.1287/mnsc.18.11.721openalex-snapshot
Erratum: Deterministic Production Planning with Concave Costs and Capacity Constraints
inferredcites →https://doi.org/10.1287/mnsc.19.11.1295openalex-snapshot
A Class of Deterministic Production Planning Problems
inferredcites →https://doi.org/10.1287/mnsc.20.3.313openalex-snapshot
Bounded Production and Inventory Models with Piecewise Concave Costs
inferredcites →https://doi.org/10.1287/mnsc.21.10.1086openalex-snapshot
Multi-Item Lot Size Scheduling by Heuristic Part I: With Fixed Resources
inferredcites →https://doi.org/10.1287/mnsc.22.5.587openalex-snapshot
A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
inferredcites →https://doi.org/10.1287/mnsc.24.16.1710openalex-snapshot
An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
inferredcites →https://doi.org/10.1287/mnsc.26.5.495openalex-snapshot
Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
inferredcites →https://doi.org/10.1287/mnsc.26.7.669openalex-snapshot
Deterministic Production Planning: Algorithms and Complexity
inferredcites →https://doi.org/10.1287/mnsc.28.10.1174openalex-snapshot
Computational Complexity of the Capacitated Lot Size Problem
inferredcites →https://doi.org/10.1287/mnsc.28.3.260openalex-snapshot
Using Lagrangean Techniques to Solve Hierarchical Production Planning Problems
inferredcites →https://doi.org/10.1287/mnsc.30.10.1255openalex-snapshot
Strong Formulations for Multi-Item Capacitated Lot Sizing
inferredcites →https://doi.org/10.1287/mnsc.30.9.1121openalex-snapshot
Approximation Methods for the Uncapacitated Dynamic Lot Size Problem
inferredcites →https://doi.org/10.1287/mnsc.31.5.634openalex-snapshot
Note—Performance Bounds for Lot Sizing Heuristics
inferredcites →https://doi.org/10.1287/mnsc.32.3.350openalex-snapshot
The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations
inferredcites →https://doi.org/10.1287/mnsc.4.2.115openalex-snapshot
Programming of Economic Lot Sizes
inferredcites →https://doi.org/10.1287/mnsc.5.1.89openalex-snapshot
Dynamic Version of the Economic Lot Size Model
inferredcites →https://doi.org/10.1287/mnsc.9.2.229openalex-snapshot
Simulation Tests of Lot Size Programming
inferredcites →https://doi.org/10.1287/moor.2.1.15openalex-snapshot
Critical Cutsets of Graphs and Canonical Facets of Set-Packing Polytopes
inferredcites →https://doi.org/10.1287/moor.23.4.1022openalex-snapshot
Erratum: Critical Cutsets of Graphs and Canonical Facets of Set Packing Polytopes (Mathematics of Operations Research, Vol. 2, 1977, 15–19)
inferredcites →https://doi.org/10.1287/moor.7.1.67openalex-snapshot
Odd Minimum Cut-Sets and b -Matchings
inferredcites →https://doi.org/10.1287/moor.8.4.579openalex-snapshot
On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
inferredcites →https://doi.org/10.1287/moor.8.4.590openalex-snapshot
On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
inferredcites →https://doi.org/10.1287/opre.16.2.268openalex-snapshot
Solving the Fixed Charge Problem by Ranking the Extreme Points
inferredcites →https://doi.org/10.1287/opre.17.2.262openalex-snapshot
Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
inferredcites →https://doi.org/10.1287/opre.19.4.946openalex-snapshot
An Efficient Algorithm for Multi-Item Scheduling
inferredcites →https://doi.org/10.1287/opre.19.6.1529openalex-snapshot
Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
inferredcites →https://doi.org/10.1287/opre.20.4.860openalex-snapshot
A Decomposition Algorithm for Arborescence Inventory Systems
inferredcites →https://doi.org/10.1287/opre.23.2.299openalex-snapshot
A Lower Bounding Structure for Lot-Size Scheduling Problems
inferredcites →https://doi.org/10.1287/opre.31.5.803openalex-snapshot
Solving Large-Scale Zero-One Linear Programming Problems
inferredcites →https://doi.org/10.1287/opre.32.6.1195openalex-snapshot
A Cutting Plane Algorithm for the Linear Ordering Problem
inferredcites →https://doi.org/10.1287/opre.33.4.803openalex-snapshot
Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
inferredcites →https://doi.org/10.1287/opre.33.4.842openalex-snapshot
Valid Linear Inequalities for Fixed Charge Problems
inferredcites →https://doi.org/10.1287/opre.34.1.63openalex-snapshot
Approximation Formulations for the Single-Product Capacitated Lot Size Problem
inferredcites →https://doi.org/10.1287/opre.35.6.832openalex-snapshot
Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
inferredcites →https://doi.org/10.2307/2583737openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.2307/3009437openalex-snapshot
Decision Systems for Inventory Management and Production Planning
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4516634openalex-extracted
Risk-Averse Two-Stage Programming for Assembly Line Design Considering Dynamic Lot Sizes
inferred← citeshttps://doi.org/10.2139/ssrn.4856152openalex-extracted
A Novel Exact Algorithm for Economic Lot-Sizing with Piecewise Linear Production Costs
inferred← citeshttps://doi.org/10.1007/0-306-48109-x_5openalex-snapshot
Stochastic Batch-Sizing Problems: Models and Algorithms
inferred← citeshttps://doi.org/10.1007/0-387-24977-x_11openalex-snapshot
Synchronized Production-Distribution Planning in the Pulp and Paper Industry
inferred← citeshttps://doi.org/10.1007/3-540-45586-8_3openalex-snapshot
Mathematical Programming Models and Formulations for Deterministic Production Planning Problems
inferred← citeshttps://doi.org/10.1007/3-540-61310-2_4openalex-snapshot
Algorithms and extended formulations for one and two facility network design
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_155openalex-snapshot
Economic Lot-Sizing Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-87672-2_13openalex-snapshot
New Valid Inequalities for a Multi-echelon Multi-item Lot-Sizing Problem with Returns and Lost Sales
inferred← citeshttps://doi.org/10.1007/978-3-642-87729-2_7openalex-snapshot
Überblick über anwendungsbezogene Veröffentlichungen
inferred← citeshttps://doi.org/10.1007/978-981-19-4215-0_6openalex-snapshot
A Joint Optimization of ALBP and Lot-Sizing Under Demand Uncertainty
inferred← citeshttps://doi.org/10.1007/bf01098363openalex-snapshot
A new dynamic programming algorithm for the single item capacitated dynamic lot size model
inferred← citeshttps://doi.org/10.1007/bf01582057openalex-snapshot
A technique for speeding up the solution of the Lagrangean dual
inferred← citeshttps://doi.org/10.1007/bf01587093openalex-snapshot
Valid inequalities and facets of the capacitated plant location problem
inferred← citeshttps://doi.org/10.1007/bf02592189openalex-snapshot
A cutting plane approach to capacitated lot-sizing with start-up costs
inferred← citeshttps://doi.org/10.1007/bf03398782openalex-snapshot
Integrated inventory model for similar products under a two-echelon supply chain environment: An empirical study
inferred← citeshttps://doi.org/10.1007/s10107-002-0341-yopenalex-snapshot
Dynamic knapsack sets and capacitated lot-sizing
inferred← citeshttps://doi.org/10.1007/s10107-003-0465-8openalex-snapshot
A study of the lot-sizing polytope
inferred← citeshttps://doi.org/10.1007/s10107-005-0572-9openalex-snapshot
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
inferred← citeshttps://doi.org/10.1007/s10288-019-00403-3openalex-snapshot
Batch replenishment planning under capacity reservation contract
inferred← citeshttps://doi.org/10.1007/s10288-020-00456-9openalex-snapshot
Models and algorithms for decomposition problems
inferred← citeshttps://doi.org/10.1007/s10479-005-3453-yopenalex-snapshot
Classical Cuts for Mixed-Integer Programming and Branch-and-Cut
inferred← citeshttps://doi.org/10.1007/s10479-017-2662-5openalex-snapshot
A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand
inferred← citeshttps://doi.org/10.1007/s10601-018-9300-yopenalex-snapshot
The item dependent stockingcost constraint
inferred← citeshttps://doi.org/10.1007/s11518-008-5076-8openalex-snapshot
A review of tactical planning models
inferred← citeshttps://doi.org/10.1007/s40032-016-0221-5openalex-snapshot
Two Echelon Supply Chain Integrated Inventory Model for Similar Products: A Case Study
inferred← citeshttps://doi.org/10.1016/0167-6377(89)90016-3openalex-snapshot
Valid inequalities and separation for mixed 0–1 constraints with variable upper bounds
inferred← citeshttps://doi.org/10.1016/0167-6377(91)90033-lopenalex-snapshot
Restrictive aggregation of items in multi-stage production systems
inferred← citeshttps://doi.org/10.1016/0305-0548(93)90085-wopenalex-snapshot
An application of Lagrangean decomposition to the capacitated multi-item lot sizing proble
inferred← citeshttps://doi.org/10.1016/0360-8352(95)00021-ropenalex-snapshot
Computationally efficient solution of the multi-item, capacitated lot-sizing problem
inferred← citeshttps://doi.org/10.1016/0377-2217(93)90081-wopenalex-snapshot
Efficient post-optimization analysis procedure for the dynamic lot-sizing problem
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90072-8openalex-snapshot
Batching decisions: structure and models
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90419-7openalex-snapshot
Coordination of production and distribution planning
inferred← citeshttps://doi.org/10.1016/j.cie.2015.06.010openalex-snapshot
A review of tactical optimization models for integrated production and transport routing planning decisions
inferred← citeshttps://doi.org/10.1016/j.cor.2003.08.002openalex-snapshot
A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers
inferred← citeshttps://doi.org/10.1016/j.cor.2005.05.031openalex-snapshot
Analysis of bounds for a capacitated single-item lot-sizing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2014.08.022openalex-snapshot
Multi-product valid inequalities for the discrete lot-sizing and scheduling problem
inferred← citeshttps://doi.org/10.1016/j.cor.2017.11.006openalex-snapshot
Partial objective inequalities for the multi-item capacitated lot-sizing problem
inferred← citeshttps://doi.org/10.1016/j.dam.2009.06.010openalex-snapshot
Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
inferred← citeshttps://doi.org/10.1016/j.disopt.2011.09.001openalex-snapshot
A polyhedral study of lot-sizing with supplier selection
inferred← citeshttps://doi.org/10.1016/j.ejor.2004.01.054openalex-snapshot
Single item lot sizing problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.12.008openalex-snapshot
Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.01.053openalex-snapshot
The multi-item capacitated lot-sizing problem with setup times and shortage costs
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.06.040openalex-snapshot
Improved exact algorithms to economic lot-sizing with piecewise linear production costs
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.09.043openalex-snapshot
A risk-averse two-stage stochastic programming model for a joint multi-item capacitated line balancing and lot-sizing problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.08.026openalex-snapshot
A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.03.003openalex-snapshot
Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups
inferred← citeshttps://doi.org/10.1016/j.ijpe.2010.09.023openalex-snapshot
An efficient heuristic for medium-term planning in shampoo production
inferred← citeshttps://doi.org/10.1016/j.omega.2024.103092openalex-snapshot
Risk-averse two-stage stochastic programming for assembly line reconfiguration with dynamic lot sizes
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00024-9openalex-snapshot
Source sink flows with capacity installation in batches
inferred← citeshttps://doi.org/10.1016/s0305-0483(03)00059-8openalex-snapshot
The capacitated lot sizing problem: a review of models and algorithms
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00461-0openalex-snapshot
On the capacitated lot-sizing and continuous 0–1 knapsack polyhedra
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80118-5openalex-snapshot
Chapter 1 Applications of network optimization
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80126-4openalex-snapshot
Chapter 9 Optimal trees
inferred← citeshttps://doi.org/10.1021/ie980782topenalex-snapshot
A Hierarchical Lagrangean Relaxation Procedure for Solving Midterm Planning Problems
inferred← citeshttps://doi.org/10.1023/a:1018963805173openalex-snapshot
A polyhedral approach to a production planning problem
inferred← citeshttps://doi.org/10.1051/ro:2007014openalex-snapshot
MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
inferred← citeshttps://doi.org/10.1080/00207540210159617openalex-snapshot
An integrated model for inventory and production planning in a two-stage hybrid production system
inferred← citeshttps://doi.org/10.1080/00207540500057589openalex-snapshot
Heuristics for theN-product,M-stage, economic lot sizing and scheduling problem with dynamic demand
inferred← citeshttps://doi.org/10.1080/00207543.2018.1475766openalex-snapshot
Biomass feedstock supply chain design – a taxonomic review and a decomposition-based methodology
inferred← citeshttps://doi.org/10.1080/00207549508904793openalex-snapshot
A framework for modelling setup carryover in the capacitated lot sizing problem
inferred← citeshttps://doi.org/10.1080/00207720903579013openalex-snapshot
Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost
inferred← citeshttps://doi.org/10.1080/07408170600862688openalex-snapshot
On the integrated production, inventory, and distribution routing problem
inferred← citeshttps://doi.org/10.1080/0740817x.2010.504683openalex-snapshot
Dynamic-programming-based inequalities for the capacitated lot-sizing problem
inferred← citeshttps://doi.org/10.1080/0740817x.2014.882529openalex-snapshot
Primary pharmaceutical manufacturing scheduling problem
inferred← citeshttps://doi.org/10.1080/10556788.2017.1368508openalex-snapshot
Improved algorithms for dynamic lot sizing problems with incremental discount
inferred← citeshttps://doi.org/10.1109/icsmc.2002.1176441openalex-snapshot
A review of single item lot sizing problems
inferred← citeshttps://doi.org/10.1109/icsssm.2006.320529openalex-snapshot
A review of tactical planning models
inferred← citeshttps://doi.org/10.1111/j.1540-5414.2004.02396.xopenalex-snapshot
Coordinated Capacitated Lot‐Sizing Problem with Dynamic Demand: A Lagrangian Heuristic
inferred← citeshttps://doi.org/10.1137/s0895480191196289openalex-snapshot
Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs
inferred← citeshttps://doi.org/10.11606/d.45.2011.tde-24042011-234514openalex-snapshot
Planejamento de produção através do dimensionamento de lotes de itens únicos
inferred← citeshttps://doi.org/10.11606/d.55.2016.tde-05122016-101153openalex-snapshot
Métodos de solução aplicados ao problema de produção e distribuição
inferred← citeshttps://doi.org/10.1201/b17414-11openalex-snapshot
Multistage Production and Distribution Planning Problems
inferred← citeshttps://doi.org/10.1287/educ.1110.0085openalex-snapshot
Mixed-Integer Optimization Approaches for Deterministic and Stochastic Inventory Management
inferred← citeshttps://doi.org/10.1287/mnsc.44.10.1409openalex-snapshot
Lot-Sizing with Start-Up Times
inferred← citeshttps://doi.org/10.1287/mnsc.44.6.831openalex-snapshot
An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs
inferred← citeshttps://doi.org/10.1287/mnsc.48.12.1587.442openalex-snapshot
Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation
inferred← citeshttps://doi.org/10.1287/moor.18.4.767openalex-snapshot
Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
inferred← citeshttps://doi.org/10.1287/moor.26.2.339.10552openalex-snapshot
Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
inferred← citeshttps://doi.org/10.1287/opre.1050.0223openalex-snapshot
Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
inferred← citeshttps://doi.org/10.1287/opre.1050.0255openalex-snapshot
Requirements Planning with Pricing and Order Selection Flexibility
inferred← citeshttps://doi.org/10.1287/opre.1070.0392openalex-snapshot
Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
inferred← citeshttps://doi.org/10.1287/opre.1070.0404openalex-snapshot
A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
inferred← citeshttps://doi.org/10.1287/opre.37.5.716openalex-snapshot
A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
inferred← citeshttps://doi.org/10.1287/opre.38.3.456openalex-snapshot
A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
inferred← citeshttps://doi.org/10.1287/opre.43.1.142openalex-snapshot
Modeling and Solving the Two-Facility Capacitated Network Loading Problem
inferred← citeshttps://doi.org/10.1287/trsc.33.3.330openalex-snapshot
Synchronized Development of Production, Inventory, and Distribution Schedules
inferred← citeshttps://doi.org/10.1504/ijmor.2010.035496openalex-snapshot
Metaheuristic for the capacitated lot-sizing problem: a software tool for MPS elaboration
inferred← citeshttps://doi.org/10.21236/ada459506openalex-snapshot
A Technique for Speeding Up the Solution of the Lagrangean Dual
inferred← citeshttps://doi.org/10.21608/bfemu.2021.201585openalex-snapshot
Biogas Utilization Model Using Linear Programming for Layer Farms. (Dept. P)
inferred← citeshttps://doi.org/10.70675/01fb4aabz6990z488ezb97fz81978452f4baopenalex-snapshot
Batch replenishment planning under capacity reservation contract
inferred← citeshttps://doi.org/10.70675/3d618c88z171bz4a47za34dzef2b804c9892openalex-snapshot
Construction de modèles d’aide à la décision pour une planification intégrée des activités de la Supply Chain minière
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.