The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "4OR"( http://dblp.L3S.de/Venues/4OR )

URL (DBLP): http://dblp.uni-trier.de/db/journals/4or

Publication years (Num. hits)
2003 (23) 2004 (26) 2005 (25) 2006 (23) 2007 (26) 2008 (27) 2009 (33) 2010 (31) 2011 (35) 2012 (34) 2013 (31) 2014 (28) 2015 (27) 2016 (26) 2017 (27) 2018 (30) 2019 (27) 2020 (29) 2021 (34) 2022 (32) 2023 (34) 2024 (9)
Publication types (Num. hits)
article(617)
Venues (Conferences, Journals, ...)
4OR(617)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 349 occurrences of 207 keywords

Results
Found 617 publication records. Showing 617 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Tito A. Ciriani, Yves Colombani, Susanne Heipcke Embedding optimisation algorithms with Mosel. Search on Bibsonomy 4OR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF column generation, Modelling tools, cutting stock, cutting plane algorithm, out sourcing
1Emilio Spedicato, Elena Bodon, Antonino Del Popolo, Nezam Mahdavi-Amiri ABS methods and ABSPACK for linear systems and optimization: A review. Search on Bibsonomy 4OR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF ABS methods, linear algebraic systems, feasible direction methods, ABSPACK, simplex method, Diophantine equations
1Roberto Aringhieri, Pierre Hansen, Federico Malucelli Chemical trees enumeration algorithms. Search on Bibsonomy 4OR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Exact enumeration problems, enumeration of graphs and maps, applications, trees, generating functions
1Adam N. Letchford, Andrea Lodi 0001 Primal separation algorithms. Search on Bibsonomy 4OR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF primal algorithms, stable set problem, Integer programming, travelling salesman problem, separation, knapsack problem
1Kenneth Sörensen A framework for robust and flexible optimisation using metaheuristics. Search on Bibsonomy 4OR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF supply chain design, Robustness, flexibility, metaheuristics
1Jérôme Monnot, Olivier Spanjaard Bottleneck shortest paths on a partially ordered scale. Search on Bibsonomy 4OR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF bottleneck problems, Shortest path, partial order, algebraic methods
1Jean-François Cordeau, Gilbert Laporte The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms. Search on Bibsonomy 4OR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF dial-a-ride problem, static and dynamic pick-up and delivery problems, survey
1Marta M. B. Pascoal, M. Eugénia V. Captivo, João C. N. Clímaco A note on a new variant of Murty's ranking assignments algorithm. Search on Bibsonomy 4OR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Graph theory, mathematical programming, combinatorics
1Denis Bouyssou, Silvano Martello, Frank Plastria 4OR for what purpose? Search on Bibsonomy 4OR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Quentin Louveaux, Laurence A. Wolsey Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. Search on Bibsonomy 4OR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF mixed integer rounding, single node flow sets, Lifting
1Roberto Montemanni Upper and lower bounds for the fixed spectrum frequency assignment problem. Search on Bibsonomy 4OR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Radio frequency assignment, fixed spectrum, lower bounds, upper bounds
1Michele Monaci Algorithms for packing and scheduling problems. Search on Bibsonomy 4OR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Luc Muyldermans Routing, districting and location for arc traversal problems. Search on Bibsonomy 4OR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF districting, local search, location, Arc routing
1Ernesto de Queirós Vieira Martins, Marta M. B. Pascoal A new implementation of Yen's ranking loopless paths algorithm. Search on Bibsonomy 4OR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF loopless path, paths ranking, network, path
1Marco A. Boschetti, Aristide Mingozzi The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case. Search on Bibsonomy 4OR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Lower Bounds, Combinatorial Optimization, Cutting and Packing
1Alessandro Agnetis, Paolo Detti, Carlo Meloni Process selection and sequencing in a two-agents production system. Search on Bibsonomy 4OR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF algorithms, sequencing, network flows, operations management
1Francesco Maffioli The vehicle routing problem: A book review. Search on Bibsonomy 4OR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
Displaying result #601 - #617 of 617 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license