The following pages link to Alain Billionnet (Q176416):
Displaying 42 items.
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems (Q304240) (← links)
- Reconstructing convex matrices by integer programming approaches (Q387306) (← links)
- Extending the QCR method to general mixed-integer programs (Q662304) (← links)
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem (Q703909) (← links)
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem (Q868442) (← links)
- Optimal selection of forest patches using integer and fractional programming (Q968037) (← links)
- Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem (Q969344) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- (Q1069443) (redirect page) (← links)
- Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions (Q1069444) (← links)
- A decomposition method for minimizing quadratic pseudo-Boolean functions (Q1118533) (← links)
- Optimal implementation of selectors in a data-base (Q1166277) (← links)
- Persistency in quadratic 0-1 optimization (Q1190604) (← links)
- An efficient algorithm for the 3-satisfiability problem (Q1200758) (← links)
- Linear programming for the \(0-1\) quadratic knapsack problem (Q1268263) (← links)
- Partitioning multiple-chain-like task across a host-satellite system (Q1313732) (← links)
- Solving the uncapacited plant location problem on trees (Q1327217) (← links)
- Minimization of a quadratic pseudo-Boolean function (Q1341991) (← links)
- A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem (Q1356513) (← links)
- Mixed integer programming for the 0--1 maximum probability model. (Q1426689) (← links)
- A new upper bound for the 0-1 quadratic knapsack problem (Q1806683) (← links)
- Integer programming to schedule a hierarchical workforce with variable demands (Q1809829) (← links)
- Approximation algorithms for fractional knapsack problems (Q1866996) (← links)
- Designing radio-mobile access networks based on synchronous digital hierarchy rings (Q1885949) (← links)
- An algorithm for finding the \(K\)-best allocations of a tree structured program (Q1893670) (← links)
- An efficient compact quadratic convex reformulation for general integer quadratic programs (Q1938903) (← links)
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation (Q2251137) (← links)
- Unconstrained 0-1 optimization and Lagrangean relaxation (Q2277361) (← links)
- Mathematical optimization ideas for biodiversity conservation (Q2356177) (← links)
- A deterministic approximation algorithm for the densest \(k\)-subgraph problem (Q2427738) (← links)
- 2-stage robust MILP with continuous recourse variables (Q2449080) (← links)
- Reconstruction of Bicolored Images (Q2794643) (← links)
- Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem (Q2890419) (← links)
- Comparaison expérimentale d'algorithmes pour les problèmes de recouvrement et de maximisation d'une fonction pseudo-booléenne (Q3039041) (← links)
- (Q3081839) (← links)
- (Q3216685) (← links)
- Solution of a fractional combinatorial optimization problem by mixed integer programming (Q3411295) (← links)
- Multiway cut and integer flow problems in trees (Q3439138) (← links)
- Minimising total average cycle stock subject to practical constraints (Q4678236) (← links)
- A tabu search approach for the reconstruction of binary images without empty interior region (Q5273297) (← links)
- Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation (Q5364279) (← links)
- Quantifying extinction probabilities of endangered species for phylogenetic conservation prioritization may not be as sensitive as might be feared (Q6394474) (← links)
