Pages that link to "Item:Q1803672"
From MaRDI portal
The following pages link to Efficient reformulation for 0-1 programs -- methods and computational results (Q1803672):
Displaying 21 items.
- Some of my favorite integer programming applications at IBM (Q537591) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- A conditional logic approach for strengthening mixed 0-1 linear programs (Q817194) (← links)
- Coefficient strengthening: a tool for reformulating mixed-integer programs (Q847848) (← links)
- \(O(n \log n)\) procedures for tightening cover inequalities (Q1124826) (← links)
- Reformulating nonlinear combinatorial optimization problems for higher computational efficiency (Q1194735) (← links)
- On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint (Q1304779) (← links)
- On surrogating 0-1 knapsack constraints (Q1304781) (← links)
- Order selection on a single machine with high set-up costs (Q1309884) (← links)
- Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts (Q1328648) (← links)
- Supernode processing of mixed-integer models (Q1342883) (← links)
- Some properties of cliques in 0-1 mixed integer programs (Q1367871) (← links)
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems (Q1694780) (← links)
- \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates (Q1804563) (← links)
- On identifying dominant cliques. (Q1811147) (← links)
- On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs (Q1814812) (← links)
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems (Q1866008) (← links)
- Tightening concise linear reformulations of 0-1 cubic programs (Q2810099) (← links)
- A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems (Q5101409) (← links)
- A new idea on the interval-symbol method with correct zero rewriting for reducing exact computations (Q5268827) (← links)
- A note for tightening 0-1 models (Q5937145) (← links)
