The following pages link to Margot, François (Q163021):
Displayed 50 items.
- Item:Q163021 (redirect page) (← links)
- On the relative strength of split, triangle and quadrilateral cuts (Q623365) (← links)
- Optimization for simulation: LAD accelerator (Q646715) (← links)
- Testing cut generators for mixed-integer linear programming (Q734353) (← links)
- On the safety of Gomory cut generators (Q744203) (← links)
- Greedy-type resistance of combinatorial problems (Q865746) (← links)
- Cut generation through binarization (Q896284) (← links)
- An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
- A feasibility pump for mixed integer nonlinear programs (Q1013979) (← links)
- Item:Q163021 (redirect page) (← links)
- A note on order preserving matchings (Q1121175) (← links)
- Quick updates for \(p\)-opt TSP heuristics (Q1198624) (← links)
- Weak \(k\)-majorization and polyhedra (Q1290598) (← links)
- A catalog of minimally nonideal matrices (Q1298742) (← links)
- Tree polytope on 2-trees (Q1322553) (← links)
- Some complexity results about threshold graphs (Q1327235) (← links)
- Pruning by isomorphism in branch-and-cut (Q1396814) (← links)
- Small covering designs by branch-and-cut (Q1411610) (← links)
- Exploiting orbits in symmetric ILP (Q1424276) (← links)
- Item:Q163021 (redirect page) (← links)
- TSP heuristics: domination analysis and complexity (Q1566378) (← links)
- Comparison of least squares Monte Carlo methods with applications to energy real options (Q1752185) (← links)
- Multiterminal flows and cuts (Q1924611) (← links)
- Generalized intersection cuts and a new cut generating paradigm (Q1942255) (← links)
- Partial hyperplane activation for generalized intersection cuts (Q2175444) (← links)
- Stronger MIP formulations for the Steiner forest problem (Q2227541) (← links)
- Min-up/min-down polytopes (Q2386215) (← links)
- On the facets of mixed integer programs with two integer variables and two constraints (Q2390999) (← links)
- Minimum number of below average triangles in a weighted complete graph (Q2465935) (← links)
- Symmetric ILP: Coloring and small integers (Q2471273) (← links)
- Classification of orthogonal arrays by integer programming (Q2475747) (← links)
- Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. (Q2482881) (← links)
- Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities (Q2830767) (← links)
- Intersection Cuts with Infinite Split Rank (Q2884303) (← links)
- On a Binary-Encoded ILP Coloring Formulation (Q2892353) (← links)
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs (Q2897305) (← links)
- Experiments with Two-Row Cuts from Degenerate Tableaux (Q2899149) (← links)
- Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing (Q2901077) (← links)
- A Probing Algorithm for MINLP with Failure Prediction by SVM (Q3003284) (← links)
- An Approximate Dynamic Programming Approach to Benchmark Practice-Based Heuristics for Natural Gas Storage Valuation (Q3098256) (← links)
- (Q3353059) (← links)
- Branching and bounds tighteningtechniques for non-convex MINLP (Q3396388) (← links)
- Integer programming solution approach for inventory‐production–distribution problems with direct shipments (Q3499436) (← links)
- Symmetry in Integer Linear Programming (Q3565246) (← links)
- Octane: A New Heuristic for Pure 0–1 Programs (Q3634996) (← links)
- Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem (Q3637403) (← links)
- (Q3840342) (← links)
- (Q4537751) (← links)
- (Q4633937) (← links)
- (Q4836157) (← links)