The following pages link to Gérard Cornuéjols (Q163019):
Displaying 50 items.
- (Q3140425) (← links)
- Even-hole-free graphs part II: Recognition algorithm (Q3150171) (← links)
- Minimal Valid Inequalities for Integer Constraints (Q3169050) (← links)
- Maximal Lattice-Free Convex Sets in Linear Subspaces (Q3169114) (← links)
- On Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chvátal Rank (Q3186511) (← links)
- Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point (Q3186518) (← links)
- Integer Programming (Q3191512) (← links)
- (Q3351135) (← links)
- Optimization Methods in Finance (Q3431225) (← links)
- Polyhedral Approaches to Mixed Integer Linear Programming (Q3565240) (← links)
- On Lifting Integer Variables in Minimal Inequalities (Q3569810) (← links)
- (Q3589871) (← links)
- The traveling salesman problem on a graph and some related integer polyhedra (Q3675933) (← links)
- (Q3698661) (← links)
- Two algorithms for weighted matroid intersection (Q3770280) (← links)
- The traveling salesman problem in graphs with 3-edge cutsets (Q3773723) (← links)
- An algorithmic framework for the matching problem in some hypergraphs (Q3789371) (← links)
- (Q3840342) (← links)
- (Q3840366) (← links)
- Note—On “Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms” (Q3879020) (← links)
- Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem (Q3883859) (← links)
- Perfect triangle-free 2-matchings (Q3905324) (← links)
- (Q3934441) (← links)
- Some facets of the simple plant location polytope (Q3945954) (← links)
- A Primal Approach to the Simple Plant Location Problem (Q3958238) (← links)
- A Canonical Representation of Simple Plant Location Problems and Its Applications (Q3967331) (← links)
- (Q4132252) (← links)
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms (Q4135210) (← links)
- Tight bounds for christofides' traveling salesman heuristic (Q4180168) (← links)
- (Q4228441) (← links)
- Even and odd holes in cap-free graphs (Q4238043) (← links)
- From Totally Unimodular to Balanced 0, ±1 Matrices: A Family of Integer Polytopes (Q4294726) (← links)
- (Q4335200) (← links)
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework (Q4363673) (← links)
- A class of logic problems solvable by linear programming (Q4369892) (← links)
- (Q4398363) (← links)
- A Class of Hard Small 0-1 Programs (Q4427377) (← links)
- (Q4500707) (← links)
- (Q4537736) (← links)
- (Q4549225) (← links)
- Optimization Methods in Finance (Q4577977) (← links)
- (Q4633937) (← links)
- (Q4667215) (← links)
- (Q4737523) (← links)
- Halin graphs and the travelling salesman problem (Q4744083) (← links)
- Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour (Q4785688) (← links)
- Cut-Generating Functions (Q4910810) (← links)
- Resistant Sets in the Unit Hypercube (Q4991667) (← links)
- Idealness of k-wise Intersecting Families (Q5041730) (← links)
- On Dyadic Fractional Packings of $T$-Joins (Q5043644) (← links)
