Pages that link to "Item:Q3680609"

The following pages link to Experimental Results on the New Techniques for Integer Programming Formulations (Q3680609):

Displaying 16 items.

• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (Q543399) (← links)
• Compact normal forms in propositional logic and integer programming formulations (Q910335) (← links)
• Constructing integer programming models by the predicate calculus (Q918417) (← links)
• Generating cuts in integer programming with families of special ordered sets (Q922293) (← links)
• Modelling either-or relations in integer programming (Q1026568) (← links)
• Representability in mixed integer programming. I: Characterization results (Q1089258) (← links)
• A simplification for some disjunctive formulations (Q1104856) (← links)
• A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems (Q1122488) (← links)
• Two mixed integer programming formulations arising in manufacturing management (Q1262212) (← links)
• Optimal facility layout design (Q1306388) (← links)
• Inference flexibility in Horn clause knowledge bases and the simplex method (Q1319393) (← links)
• Future paths for integer programming and links to artificial intelligence (Q1821034) (← links)
• Representability of functions (Q1825755) (← links)
• A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization (Q2255987) (← links)
• On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations (Q2694515) (← links)
• Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)