Pages that link to "Item:Q1577382"
From MaRDI portal
The following pages link to A linearization method for mixed 0--1 polynomial programs (Q1577382):
Displaying 29 items.
- A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization (Q264238) (← links)
- A linearized value-at-risk model with transaction costs and short selling (Q320109) (← links)
- A class of polynomially solvable 0-1 programming problems and an application (Q547367) (← links)
- An efficient linearization technique for mixed 0-1 polynomial problem (Q611852) (← links)
- A conditional logic approach for strengthening mixed 0-1 linear programs (Q817194) (← links)
- ``Miniaturized'' linearizations for quadratic 0/1 problems (Q817208) (← links)
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992) (← links)
- A new global approach for \(0\)-\(1\) polynomial programs (Q1317077) (← links)
- A global approach for general \(0-1\) fractional programming (Q1328656) (← links)
- Mixed integer programming for the 0--1 maximum probability model. (Q1426689) (← links)
- A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization (Q1654574) (← links)
- Generating convex polynomial inequalities for mixed 0-1 programs (Q1810867) (← links)
- Optimization approach for data allocation in multidisk database (Q1848642) (← links)
- Optimal procurement decisions in the presence of total quantity discounts and alternative product recipes (Q1876186) (← links)
- A simple recipe for concise mixed 0-1 linearizations (Q1886797) (← links)
- Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network (Q1991177) (← links)
- An alternative efficient representation for the project portfolio selection problem (Q2329483) (← links)
- A fuzzy-budgeted robust optimization model for joint network design-pricing problem in a forward-reverse supply chain: the viewpoint of third-party logistics (Q2335473) (← links)
- A unified model for Weber problems with continuous and network distances (Q2384880) (← links)
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs (Q2386196) (← links)
- Linear forms of nonlinear expressions: new insights on old ideas (Q2457269) (← links)
- Weber problems with mixed distances and regional demand (Q2465384) (← links)
- Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation (Q3109873) (← links)
- Continuous solution method for 0-1 programming based on the sinusoidal smooth polish function (Q3176061) (← links)
- Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118) (← links)
- Global Optimization for Mixed 0-1 Programs with Convex or Separable Continuous Functions (Q4319492) (← links)
- Health service network design: a robust possibilistic approach (Q4608268) (← links)
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems (Q5202509) (← links)
- Linear Reformulation of Polynomial Discrete Programming for Fast Computation (Q5739134) (← links)
