A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
From MaRDI portal
Publication:3114873
DOI10.1287/mnsc.49.9.1268.16570zbMath1232.90311OpenAlexW2125401464MaRDI QIDQ3114873
Thomas L. Magnanti, Bernard Gendron, Keely L. Croxton
Publication date: 19 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/5233
Related Items
Exact approaches to the single-source network loading problem, A parametric simplex algorithm for biobjective piecewise linear programming problems, A branch-cut-and-price algorithm for the piecewise linear transportation problem, Multiattribute electronic procurement using goal programming, Piecewise linear bounding functions in univariate global optimization, On the hop-constrained survivable network design problem with reliable edges, A stabilized structured Dantzig-Wolfe decomposition method, Single Allocation Hub Location with Heterogeneous Economies of Scale, Global optimization for transport network expansion and signal setting, Optimistic optimization for continuous nonconvex piecewise affine functions, Optimizing production capacity and safety stocks in general acyclic supply chains, Lot Sizing with Piecewise Concave Production Costs, The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints, Multi-market portfolio optimization with conditional value at risk, On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization, Exact penalty and optimality condition for nonseparable continuous piecewise linear programming, <scp>Decomposition‐based</scp> approximation algorithms for the <scp>one‐warehouse multi‐retailer</scp> problem with concave batch order costs, Enhancing discretized formulations: the knapsack reformulation and the star reformulation, Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints, An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs, Eco-routing problem for the delivery of perishable products, An optimization method to solve a fully intuitionistic fuzzy non-linear separable programming problem, A Combined Matheuristic for the Piecewise Linear Multicommodity Network Flow Problem, Multiple criteria decision making for linguistic judgments with importance quantifier guided ordered weighted averaging operator, On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations, Locally ideal formulations for piecewise linear functions with indicator variables, A special ordered set approach for optimizing a discontinuous separable piecewise linear function, Nonconvex piecewise linear knapsack problems, Nonconvex, lower semicontinuous piecewise linear optimization, Mileage bands in freight transportation, Models and heuristics for the k ‐degree constrained minimum spanning tree problem with node‐degree costs, Models for the piecewise linear unsplittable multicommodity flow problems, Integer programming for urban design, A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization, Network design and flow problems with cross-arc costs, Global optimization for first order Markov random fields with submodular priors, Modeling disjunctive constraints with a logarithmic number of binary variables and constraints, Unnamed Item, On the capacitated concentrator location problem: a reformulation by discretization, A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application, Exact algorithms for integrated facility location and production planning problems, Polynomial cases of the economic lot sizing problem with cost discounts, Modeling and solving a multimodal transportation problem with flexible-time and scheduled services, Computing Near-Optimal Policies in Generalized Joint Replenishment, A continuous optimization model for a joint problem of pricing and resource allocation, Piecewise Linear Function Fitting via Mixed-Integer Linear Programming, On the Derivation of Continuous Piecewise Linear Approximating Functions, A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts, 0-1 reformulations of the multicommodity capacitated network design problem, An effective linear approximation method for separable programming problems, The impact of distribution system characteristics on computational tractability, An exact approach for the multicommodity network optimization problem with a step cost function, A solution procedure for mixed-integer nonlinear programming formulation of supply chain planning with quantity discounts under demand uncertainty, A MIP model for freight consolidation in road transportation considering outsourced fleet, Compact mixed-integer programming formulations in quadratic optimization
