Pages that link to "Item:Q3114873"
From MaRDI portal
The following pages link to A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems (Q3114873):
Displaying 50 items.
- A branch-cut-and-price algorithm for the piecewise linear transportation problem (Q319653) (← links)
- On the hop-constrained survivable network design problem with reliable edges (Q342080) (← links)
- A stabilized structured Dantzig-Wolfe decomposition method (Q359629) (← links)
- The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints (Q378090) (← links)
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (Q543399) (← links)
- Multiattribute electronic procurement using goal programming (Q858469) (← links)
- A special ordered set approach for optimizing a discontinuous separable piecewise linear function (Q935235) (← links)
- Nonconvex piecewise linear knapsack problems (Q948649) (← links)
- Nonconvex, lower semicontinuous piecewise linear optimization (Q951120) (← links)
- Global optimization for first order Markov random fields with submodular priors (Q967400) (← links)
- A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application (Q991831) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- An effective linear approximation method for separable programming problems (Q1036545) (← links)
- The impact of distribution system characteristics on computational tractability (Q1042484) (← links)
- Global optimization for transport network expansion and signal setting (Q1665561) (← links)
- On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization (Q1686496) (← links)
- Models for the piecewise linear unsplittable multicommodity flow problems (Q1753554) (← links)
- Integer programming for urban design (Q1755415) (← links)
- Exact penalty and optimality condition for nonseparable continuous piecewise linear programming (Q1934641) (← links)
- Enhancing discretized formulations: the knapsack reformulation and the star reformulation (Q1935879) (← links)
- Mileage bands in freight transportation (Q1991161) (← links)
- A MIP model for freight consolidation in road transportation considering outsourced fleet (Q2089621) (← links)
- Compact mixed-integer programming formulations in quadratic optimization (Q2089884) (← links)
- Piecewise linear bounding functions in univariate global optimization (Q2156897) (← links)
- Multiple criteria decision making for linguistic judgments with importance quantifier guided ordered weighted averaging operator (Q2200714) (← links)
- A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization (Q2255987) (← links)
- A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts (Q2307262) (← links)
- Locally ideal formulations for piecewise linear functions with indicator variables (Q2450745) (← links)
- Network design and flow problems with cross-arc costs (Q2482771) (← links)
- On the capacitated concentrator location problem: a reformulation by discretization (Q2496022) (← links)
- Polynomial cases of the economic lot sizing problem with cost discounts (Q2514883) (← links)
- A parametric simplex algorithm for biobjective piecewise linear programming problems (Q2628166) (← links)
- Optimistic optimization for continuous nonconvex piecewise affine functions (Q2663980) (← links)
- Optimizing production capacity and safety stocks in general acyclic supply chains (Q2664281) (← links)
- Multi-market portfolio optimization with conditional value at risk (Q2670592) (← links)
- On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations (Q2694515) (← links)
- Computing Near-Optimal Policies in Generalized Joint Replenishment (Q2815435) (← links)
- (Q2861520) (← links)
- Exact approaches to the single-source network loading problem (Q2892148) (← links)
- Lot Sizing with Piecewise Concave Production Costs (Q2940066) (← links)
- Modeling and solving a multimodal transportation problem with flexible-time and scheduled services (Q3076017) (← links)
- Piecewise Linear Function Fitting via Mixed-Integer Linear Programming (Q3386779) (← links)
- On the Derivation of Continuous Piecewise Linear Approximating Functions (Q3386781) (← links)
- Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs (Q4648687) (← links)
- Single Allocation Hub Location with Heterogeneous Economies of Scale (Q5080641) (← links)
- An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs (Q5106386) (← links)
- Exact algorithms for integrated facility location and production planning problems (Q5198685) (← links)
- An exact approach for the multicommodity network optimization problem with a step cost function (Q5244303) (← links)
- <scp>Decomposition‐based</scp> approximation algorithms for the <scp>one‐warehouse multi‐retailer</scp> problem with concave batch order costs (Q6072162) (← links)
- Eco-routing problem for the delivery of perishable products (Q6109571) (← links)
