Filtrer vos résultats
- 24
- 10
- 20
- 12
- 1
- 1
- 1
- 34
- 1
- 1
- 1
- 2
- 4
- 1
- 4
- 2
- 5
- 1
- 2
- 1
- 2
- 4
- 3
- 1
- 32
- 2
- 33
- 33
- 32
- 12
- 6
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 34
- 10
- 7
- 6
- 5
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
34 résultats
|
|
|
triés par
|
On the unit demand vehicle routing problem: flow based inequalities implied by a time dependent formulationINOC 2009, Apr 2009, Pisa, Italy
Communication dans un congrès
inria-00453488v1
|
|||
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-CutMathematical Programming, Series A, 2006, 105, pp.85-111. ⟨10.1007/s10107-005-0576-5⟩
Article dans une revue
istex
inria-00281574v1
|
|||
Column Generation Stabilization using Dual Smoothing: Theory & PracticeColumn Generation 2012, Jun 2012, Bromont, Canada
Communication dans un congrès
hal-00750573v1
|
|||
|
|
A multi scalable model based on a connexity graph representation12th International Conference on Computer System Design and Operation in the Railways and other Transit Systems, COMPRAIL 2010, Aug 2010, Beijing, China. pp.193-204, ⟨10.2495/CR100191⟩
Communication dans un congrès
inria-00547026v1
|
||
Générer des facettes pour le polytope des stables dans un graphe sans griffes par la programmation entièreFRANCORO V / ROADEF, Feb 2007, Grenoble, France
Communication dans un congrès
inria-00281949v1
|
|||
Aggregation technique applied to a clustering problem for waste collection.ROADEF 2016, Feb 2016, Compiègne, France
Communication dans un congrès
hal-01418346v1
|
|||
Column Generation Stabilization using Dual Smoothing: Theory and PracticeInforms Annual Meeting: Informatics Rising, Oct 2012, Phoenix, United States
Communication dans un congrès
hal-00750576v1
|
|||
Network flow precedence based formulations for the asymmetric traveling salesman problem with precedence constraints4th International Symposium on Combinatorial Optimization (ISCO 2016), May 2016, Vietri sul Mare, Italy
Communication dans un congrès
hal-01418319v1
|
|||
Circuit and bond polytopes in series-parallel graphsISCO 2014 - 3rd International Symposium on Combinatorial Optimization, Mar 2014, Lisbon, Portugal
Communication dans un congrès
hal-01003189v1
|
|||
|
|
Feasibility Pump Heuristics for Column Generation Approaches11th International Symposium on Experimental Algorithms, Ralf Klasing, Jun 2012, Bordeaux, France
Communication dans un congrès
hal-00686255v1
|
||
The two-edge connected hop-constrained network design problem: valid inequalities and Branch-and-CutNetworks, 2007, 49 (1), pp.116-133. ⟨10.1002/net.20146⟩
Article dans une revue
istex
inria-00281937v1
|
|||
Circuit and bond polytopes in series-parallel graphsJPOC8 - 8èmes Journées Polyèdres et Optimisation Combinatoire, Jun 2013, Clermont-Ferrand, France
Communication dans un congrès
hal-00909472v1
|
|||
Aggregation technique applied to a clustering problem4th International Symposium on Combinatorial Optimization (ISCO 2016), May 2016, Vietri sul Mare, Italy
Communication dans un congrès
hal-01418337v1
|
|||
|
|
On a Time-Dependent Formulation and an Updated Classification of ATSP FormulationsAli Ridha Mahjoub. Progress in Combinatorial Optimization, Wiley, 2011, 9781848212060
Chapitre d'ouvrage
hal-00648457v1
|
||
|
|
Node based compact formulations for the Hamiltonian p ‐median problemNetworks, In press, 82 (4), pp.336-370. ⟨10.1002/net.22163⟩
Article dans une revue
hal-04124268v1
|
||
|
|
Integer programming formulations for the k-edge-connected 3-hop-constrained network design problemNetworks, 2016, 67 (2), pp. 148-169. ⟨10.1002/net.21667⟩
Article dans une revue
hal-01281958v1
|
||
|
|
Circuit and bond polytopes on series–parallel graphsDiscrete Optimization, 2015, 17, pp.55-68. ⟨10.1016/j.disopt.2015.04.001⟩
Article dans une revue
hal-01215899v1
|
||
Primal heuristics for branch-and-priceISMP 2012 - 21th International Symposium on Mathematical Programming, Aug 2012, Berlin, Germany
Communication dans un congrès
hal-00750578v1
|
|||
Meter installation for monitoring network trafficInternational Network Optimization Conference (INOC), Apr 2007, Spa, Belgium
Communication dans un congrès
inria-00281945v1
|
|||
|
|
On the Steiner 2-edge connected subgraph polytopeRAIRO - Operations Research, 2008, 42, pp.259-283. ⟨10.1051/ro:2008022⟩
Article dans une revue
inria-00325988v1
|
||
Extending and Projecting Flow Models for the (PC)ATSPOptimization 2017, Sep 2017, Lisbon, Portugal
Communication dans un congrès
hal-01667084v1
|
|||
|
|
Natural and Extended formulations for the Time-Dependent Traveling Salesman ProblemDiscrete Applied Mathematics, 2014, Combinatorial Optimization, 164, pp.138-153. ⟨10.1016/j.dam.2011.11.019⟩
Article dans une revue
hal-00648451v1
|
||
Two edge-disjoint hop-constrained paths and polyhedraSIAM Journal on Discrete Mathematics, 2004, 18 (2), pp.287-312. ⟨10.1137/S0895480102419445⟩
Article dans une revue
inria-00281980v1
|
|||
On the k edge-disjoint 2-hop-constrained paths polytopeOperations Research Letters, 2006, 34, pp.577-582. ⟨10.1016/j.orl.2005.09.001⟩
Article dans une revue
istex
inria-00281973v1
|
|||
|
|
Combining and projecting flow models for the (Precedence Constrained) Asymmetric Traveling Salesman ProblemNetworks, 2017, 71 (4), pp.451-465. ⟨10.1002/net.21765⟩
Article dans une revue
hal-01655793v1
|
||
On a Time-Dependent Model for the Unit Demand Vehicle Routing Problem[Technical Report] 11-2007, 2007
Rapport
inria-00281964v1
|
|||
|
|
On extended formulations for the precedence constrained asymmetric traveling salesman problemNetworks, 2006, 48 (2), pp.77-89. ⟨10.1002/net.20122⟩
Article dans une revue
inria-00281586v1
|
||
On the Single Commodity Flow Formulation: Generalizing the Upper and Lower Flow Bounding Inequalities3rd International Symposium on Combinatorial Optimization (ISCO 2014), Mar 2014, Lisbon, Portugal
Communication dans un congrès
hal-01111634v1
|
|||
Branch-and-Cut algorithm for the connected-cut problemROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Société française de recherche opérationnelle et d'aide à la décision, Feb 2014, Bordeaux, France
Communication dans un congrès
hal-00946285v1
|
|||
|
|
Mathematical programming formulations for the orthogonal 2d knapsack problemROADEF, 2008, France
Communication dans un congrès
hal-00307152v1
|
- 1
- 2