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