145 results on '"Javier Marenco"'
Search Results
2. Multiobjective Formulation for Last-Mile Optimization in Wireless Networks.
3. An incremental exact algorithm for the hyper-rectangular clustering problem with axis-parallel clusters.
4. A polyhedral study of a relaxation of the routing and spectrum allocation problem (Brief Announcement).
5. A branch-and-cut algorithm for the routing and spectrum allocation problem.
6. Complete characterizations of the 2-domination and P3-hull number polytopes.
7. An integer programming approach for the hyper-rectangular clustering problem with axis-parallel clusters and outliers.
8. A hybrid heuristic for the rectilinear picture compression problem.
9. The maximum 2D subarray polytope: Facet-inducing inequalities and polyhedral computations.
10. Facet-generating procedures for the maximum-impact coloring polytope.
11. Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques.
12. Valid inequalities and complete characterizations of the 2-domination and the P3-hull number polytopes.
13. Valid inequalities and a branch-and-cut algorithm for the routing and spectrum allocation problem.
14. Scheduling the Main Professional Football League of Argentina.
15. Scheduling Multiple Sports Leagues with Travel Distance Fairness: An Application to Argentinean Youth Football.
16. The minimum chromatic violation problem: A polyhedral approach.
17. Facets based on cycles and cliques for the acyclic coloring polytope.
18. The Distance Polytope for the Vertex Coloring Problem.
19. Optimization meets Big Data: A survey.
20. Machine learning for improving performance in an evolutionary algorithm for minimum path with uncertain costs given by massively simulated scenarios.
21. Facet-generating Procedures for the Maximum-impact Coloring Polytope.
22. An Integer Programming Approach for the 2-class Single-group Classification Problem.
23. The 2D Subarray Polytope.
24. Computing the P3-hull number of a graph, a polyhedral approach.
25. On the combinatorics of the 2-class classification problem.
26. An integer programming approach to b-coloring.
27. Scheduling Argentina's professional basketball leagues: A variation on the Travelling Tournament Problem.
28. Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope.
29. General cut-generating procedures for the stable set polytope.
30. The caterpillar-packing polytope.
31. The minimum chromatic violation problem: a polyhedral study.
32. Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model.
33. An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools.
34. The maximum-impact coloring polytope.
35. Implementing a multi-user framework for vehicle routing problems: a chronicle
36. A polyhedral study of the maximum stable set problem with weights on vertex-subsets.
37. Polyhedral studies of vertex coloring problems: The standard formulation.
38. Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope.
39. The caterpillar-packing polytope.
40. A Strengthened General Cut-Generating Procedure for the Stable Set Polytope.
41. The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity.
42. Topological additive numbering of directed acyclic graphs.
43. Minimum Sum Set Coloring on some Subclasses of Block Graphs.
44. Envy-free division of discrete cakes.
45. Mathematical programming as a tool for virtual soccer coaches: a case study of a fantasy sport game.
46. On the combinatorics of the 2-class classification problem.
47. Automatic Dwelling Segmentation of the Buenos Aires Province for the 2010 Argentinian Census.
48. An approach for efficient ship routing.
49. Mathematical models for optimizing production chain planning in salmon farming.
50. A polyhedral study of the acyclic coloring problem.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.