| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Luidi Simonetti, Fábio Protti, Yuri Frota, Cid C. de Souza |
New branch-and-bound algorithms for k-cardinality tree problems.  |
Electronic Notes in Discrete Mathematics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Giuseppe Lancia, Paolo Serafini |
An effective compact formulation of the max cut problem on sparse graphs. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Serafino Cicerone |
Characterizations of Graphs with Stretch Number less than 2. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastián Urrutia, Abilio Lucena |
A New Formulation for Spanning Trees. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mónica Braga, Javier Marenco |
Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sidi Mohamed Sedjelmaci |
Some Related Functions to Integer GCD and Coprimality. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | George B. Mertzios, Ivona Bezáková |
Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina G. Fernandes, Carlos Eduardo Ferreira, Flavio Keidi Miyazawa, Yoshiko Wakabayashi |
Selfish Square Packing. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oscar Rojo, Israel Rocha, Vilmar Trevisan |
Algebraic connectivity on a subclass of caterpillars. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrea Jiménez, Marcos A. Kiwi |
Counting perfect matchings in the geometric dual. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mariana S. Escalante, Javier L. Marenco, María del Carmen Varaldo |
A polyhedral study of the single-item lot-sizing problem with continuous start-up costs. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon |
Finding an induced subdivision of a digraph. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabián Riquelme, Andreas Polyméris |
On the Complexity of the Decisive Problem in Simple and Weighted Games. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pascal Ochem, Alexandre Pinlou |
Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Zych, Davide Bilò |
New Reoptimization Techniques applied to Steiner Tree Problem. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Lerme, Lucas Létocart, François Malgouyres |
Reduced graphs for min-cut/max-flow approaches in image segmentation. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Javier Marenco, Tomás Tetzlaff |
Envy-free division of discrete cakes. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mekkia Kouider, Mario Valencia-Pabon |
On lower bounds for the b-chromatic number of connected bipartite graphs. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pedro Munari, Pablo González-Brevis, Jacek Gondzio |
A note on the primal-dual column generation method for combinatorial optimization. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillermo Durán, Luciano N. Grippo, Martín Darío Safe |
Probe interval and probe unit interval graphs on superclasses of cographs. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gabriela R. Argiroffo, Graciela L. Nasini, P. Torres |
Polynomial instances of the Packing Coloring Problem. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | A. N. Martinhão, Emerson L. Monte Carmelo |
Short coverings and matching in weighted graphs. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Campos, C. Linhares Sales, Ana Karolinna Maia, Nicolas Martins, Rudini Menezes Sampaio |
Restricted coloring problems on graphs with few P'4s. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann |
Approximating Subdense Instances of Covering Problems. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sounaka Mishra |
On the Maximum Uniquely Restricted Matching for Bipartite Graphs. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jefferson L. M. da Silveira, Eduardo C. Xavier, Flávio Keidi Miyazawa |
Two Dimensional Strip Packing with Unloading Constraints. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mitre Costa Dourado, Guillermo Durán, Luerbio Faria, Luciano N. Grippo, Martín Darío Safe |
Forbidden subgraphs and the Kőnig property. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Luciano L. Silveira, Marcelo H. de Carvalho |
Ear decompositions of join covered graphs. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Y. Kohayakawa, P. B. Konstadinidis, G. O. Mota |
On an anti-Ramsey property of random graphs. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Boussemart, Fred Hemery, Christophe Lecoutre, Mouny Samy Modeliar |
Efficient Constraint Propagation for Graph Coloring. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Telma Pará, Simone Dantas, Sylvain Gravier |
Strong reducibility of powers of paths and powers of cycles on Impartial Solitaire Clobber. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | D. Sasaki, S. Dantas, C. M. H. de Figueiredo |
On Coloring Problems of Snark Families. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pablo De Caria, Marisa Gutierrez |
Comparing trees characteristic to chordal and dually chordal graphs. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pablo De Caria |
The difference between clique graphs and iterated clique graphs. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruslan Sadykov, François Vanderbeck |
Column Generation for Extended Formulations. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Flavia Bonomo, Thomas M. Liebling, Javier Marenco, Jayme Luiz Szwarcfiter, Mario Valencia-Pabon |
LAGOS 2011 - VI Latin-American Algorithms, Graphs, and Optimization Symposium. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hernán Berinsky, Paula Zabala |
An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star Problem. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler |
Clique-perfectness of complements of line graphs. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gordana Manic, Daniel M. Martin, Milos Stojakovic |
Bichromatic Triangle Games. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fernando Afonso Santos, Geraldo Robson Mateus, Alexandre Salles da Cunha |
A Branch-and-price algorithm for a Vehicle Routing Problem with Cross-Docking. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern |
String graphs of k-bend paths on a grid. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina G. Fernandes, Maya Stein |
Stability in geodesics for memoryless binary long-lived consensus. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severin |
Polyhedral results for the Equitable Coloring Problem. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | José A. Soto |
A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable Matroids. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Karla Roberta Lima, Yoshiko Wakabayashi |
Convex Recoloring of Paths. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jefferson L. M. da Silveira, Eduardo C. Xavier, Flávio Keidi Miyazawa |
Two Dimensional Knapsack with Unloading Constraints. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Diego Delle Donne, Guillermo Durán, Javier Marenco |
Solving the segmentation problem for the 2010 Argentine census with integer programming. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel |
Some advances on Lovász-Schrijver N+(⋅) relaxations of the fractional stable set polytope. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Y. Kohayakawa, G. O. Mota, R. F. Parente |
A note on counting orientations. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Guido Lagos, Daniel G. Espinoza, Eduardo Moreno, Jorge Amaya |
Robust Planning for an Open-Pit Mining Problem under Ore-Grade Uncertainty. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ricardo Corrêa, Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio |
A note on random k-dimensional posets. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Liliana Alcón |
Non-separating cliques, asteroidal number and leafage. The minimal 4-asteroidal split graphs. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel |
Near-perfect graphs with polyhedral N+(G). |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Maya Stein, José Zamora |
The relative degree and large complete minors in infinite graphs. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | C. E. Ferreira, A. S. Freire, G. A. Puglia |
A dynamic programming algorithm for the tree mapping problem. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Andrés Montoya, Francisco Gutierrez, Luis E. Zambrano |
Some Applications of the Schutzenberger-Bertoni Method. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Patricia Dobson, Valeria A. Leoni, Graciela L. Nasini |
Polynomial reductions between the Limited Packing and Tuple Domination problems in graphs. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dilson Lucas Pereira, Alexandre Salles da Cunha, Geraldo Robson Mateus |
Stronger column generation bounds for the Minimum Cost Hop-and-root Constrained Forest Problem. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | L. R. Bueno, Celina M. Herrera de Figueiredo, Luerbio Faria, Candido F. X. Mendonça, Rodrigo de A. Hausen |
Hamiltonian Cycles in Kneser Graphs for n=2k+2. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Javier Marenco, Daniela Sabán |
Combinatorial properties and further facets of maximum edge subgraph polytopes. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Edna Ayako Hoshino |
The minimum cut cover problem. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Álinson S. Xavier, Manoel B. Campêlo |
A New Facet Generating Procedure for the Stable Set Polytope. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Takashi Yamada, Takayoshi Shoudai |
Efficient Pattern Matching on Graph Patterns of Bounded Treewidth. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pablo Adasme, Abdel Lisser, Ismael Soto |
A Two Stage Stochastic Semidefinite Relaxation for wireless OFDMA Networks. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rafael Ayala, Desamparados Fernández-Ternero, José A. Vilches |
A graph-theoretical approach to cancelling critical elements. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Néstor E. Aguilera, Mariana S. Escalante, Pablo G. Fekete |
On the facets of the lift-and-project relaxations of graph subdivisions. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eugenia Holm, Luis Miguel Torres, Annegret Katrin Wagler |
A lower bound on the Chvátal-rank of Antiwebs. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Christophe Paul |
Contracting chordal graphs and bipartite graphs to paths and trees. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sangho Shim, Ellis L. Johnson, Wenwei Cao |
Primal-dual simplex method for shooting. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Virginie Gabrel, Cécile Murat, Nabila Remli, Mathieu Lacroix |
Recourse problem of the 2-stage robust location transportation problem. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Viet Hung Nguyen, Thi Thu Thuy Nguyen |
Approximating the asymmetric profitable tour. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Walid Ben-Ameur, Mohamed Didi Biha |
Algorithms and formulations for the minimum cut separator problem. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Maischak, Andreas Krebs, Ernst P. Stephan |
A quadratic programming problem arising from the p-version for obstacle problems. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Svetlana Yaremchuk, Roman Burda, Oleg Morgalyuk |
The minimax problem solving of physical fields sources allocation in specified positions. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Melquíades Pérez Pérez, Francisco Almeida, J. M. Moreno Vega, Vicente Blanco Pérez, Adrián Santos |
Exposing Metaheuristics as Web Services in Distributed Systems using OpenCF. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Patricia Dobson, Valeria A. Leoni, Graciela L. Nasini |
The k-limited packing and k-tuple domination problems in strongly chordal, P4-tidy and split graphs. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sophie Toulouse |
Approximability of the Multiple Stack TSP. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marie-Claude Côté, Bernard Gendron, Louis-Martin Rousseau |
Grammar-Based Integer Programming Models for Multi-Activity Shift Scheduling. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Luís Gouveia, Juan José Salazar González |
On the Vehicle Routing Problem with lower bound capacities. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Artigues, Nicolas Jozefowiez, Mohamed Ali Aloulou |
An exact method for the bi-objective one-machine problem with maximum lateness and unit family setup cost objectives. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Luís Gouveia, Pedro Moura |
Spanning Trees with Node Degree Dependent Costs and Knapsack Reformulations. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Anis Gharbi, Talel Ladhari, Mohamed Kais Msakni, Mehdi Serairi |
Polynomial Lower Bounds for the Two-Machine Flowshop Problem with Sequence-Independent Setup Times. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Segla Kpodjedo, Philippe Galinier, Giuliano Antoniol |
On the use of similarity metrics for approximate graph matching. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Abdel Lisser, Rafael Lopez |
Stochastic Quadratic Knapsack with Recourse. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pablo A. Maya, Kenneth Sörensen, Peter Goos |
An efficient metaheuristic to improve accessibility by rural road network planning. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Wafa Karoui, Marie-José Huguet, Pierre Lopez, Mohamed Haouari |
Climbing discrepancy search for flowshop and jobshop scheduling with time lags. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leonardo Conegundes Martinez, Alexandre Salles da Cunha |
Finding min-degree constrained spanning trees faster with a Branch-and-cut algorithm. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnaud Pêcher, Annegret Katrin Wagler |
Clique and chromatic number of circular-perfect graphs. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mahfuza Sharmin, Rukhsana Yeasmin, Masud Hasan, Atif Rahman, Mohammad Sohel Rahman |
Pancake Flipping with Two Spatulas. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Péter Biró, Eric McDermid |
Matching with sizes (or scheduling with processing set restrictions). |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Saïd Hanafi, Jasmina Lazic, Nenad Mladenovic |
Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Balázs Dezso, Alpár Jüttner, Péter Kovács |
Column Generation Method for an Agent Scheduling Problem. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammadreza Galavii |
The inverse 1-median problem on a tree and on a path. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Melanie Schmidt, Martin Skutella |
Earliest Arrival Flows in Networks with Multiple Sinks. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tristram Gräbener, Alain Berro, Yves Duthen |
Time dependent multiobjective best path for multimodal urban routing. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivana Ljubic, Stefan Gollowitzer |
Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Valeria Leggieri, Mohamed Haouari, Chefi Triki |
An Exact Algorithm for the Steiner Tree Problem with Delays. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillermo De Ita Luna, José Raymundo Marcial-Romero, Héctor A. Montes Venegas |
Estimating the relevance on Communication Lines Based on the Number of Edge Covers. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gabriela R. Argiroffo, Silvia M. Bianchi |
Row family inequalities for the set covering polyhedron. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Isabel Méndez-Díaz, Juan José Miranda Bront, Gustavo J. Vulcano, Paula Zabala |
A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")