The following pages link to (Q4124606):
Displaying 28 items.
- Mixed-integer bilinear programming problems (Q687032) (← links)
- Logical processing for integer programming (Q817209) (← links)
- Constructing integer programming models by the predicate calculus (Q918417) (← links)
- Global solution of optimization problems with signomial parts (Q924639) (← links)
- Representability in mixed integer programming. I: Characterization results (Q1089258) (← links)
- Some aspects of integer programming duality (Q1148793) (← links)
- Heuristics and their design: A survey (Q1152854) (← links)
- Facility siting and integer-friendly programming (Q1261377) (← links)
- The splitting of variables and constraints in the formulation of integer programming models (Q1278148) (← links)
- Facets for node packing (Q1278997) (← links)
- Tools for reformulating logical forms into zero-one mixed integer programs (Q1317155) (← links)
- Reducing the number of variables in integer and linear programming problems (Q1326508) (← links)
- Solving the anti-covering location problem using Lagrangian relaxation (Q1373891) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems (Q1694780) (← links)
- Representability of functions (Q1825755) (← links)
- A parametric approach to integer linear fractional programming: Newton's and hybrid-Newton methods for an optimal road maintenance problem (Q2029281) (← links)
- Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations (Q2274883) (← links)
- Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
- A direct dual method for the mixed plant location problem with some side constraints (Q3206665) (← links)
- LP extreme points and cuts for the fixed-charge network design problem (Q3778564) (← links)
- An implementation of the simplex method for linear programming problems with variable upper bounds (Q3934132) (← links)
- Bibliography in fractional programming (Q3958287) (← links)
- A Canonical Representation of Simple Plant Location Problems and Its Applications (Q3967331) (← links)
- Analysis of mathematical programming problems prior to applying the simplex algorithm (Q4079319) (← links)
- Compact LP bases for a class of IP problems (Q4135217) (← links)
- The reformulation of two mixed integer programming problems (Q4156592) (← links)
- A portfolio optimization approach to design of congested multi‐service networks with application in community healthcare: fractional 0‐1 programming (Q6092601) (← links)
