Výsledky vyhledávání - "implicit enumeration algorithm"

A Massively Parallel Exact Solution Algorithm for the Balanced Minimum Evolution Problem

Autoři: Catanzaro, Daniele Frohn, Martin Pesenti, Raffaele a další

Přispěvatelé: Catanzaro, Daniele Frohn, Martin Pesenti, Raffaele a další

Témata: Combinatorial optimization, network design, balanced minimum evolution, implicit enumeration algorithm, parallel computing, numerical stability

Relation: boreal:254728; http://hdl.handle.net/2078.1/254728

Dostupnost: http://hdl.handle.net/2078.1/254728

Travel itinerary problem

Autoři: Li, Xiang Zhou, Jiandong Zhao, Xiande

Zdroj: SCI ; SCIE ; SSCI ; Scopus ; ABDC-A*

Témata: ALGORITHM, DEMAND, Implicit enumeration algorithm, SALESMAN PROBLEM, Smart travel, Travel itinerary problem

Popis souboru: text/html

Relation: http://dx.doi.org/10.1016/j.trb.2016.05.013; http://ir.ceibs.edu/item/ir/2503

Dostupnost: https://doi.org/10.1016/j.trb.2016.05.013
http://ir.ceibs.edu/item/ir/2503

[Untitled]

Přispěvatelé: The Pennsylvania State University CiteSeerX Archives

Zdroj: http://ir.lib.ncut.edu.tw/bitstream/987654321/2379/1/%E9%99%B3%E7%A7%80%E8%8F%AF+j12.pdf.

Témata: Freight transportation, Network design, Hub-and-spoke networks, Implicit enumeration algorithm of scale by consolidating small shipments, allowing shippers to ship-on-order

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.614.6522; http://ir.lib.ncut.edu.tw/bitstream/987654321/2379/1/%E9%99%B3%E7%A7%80%E8%8F%AF+j12.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.614.6522
http://ir.lib.ncut.edu.tw/bitstream/987654321/2379/1/%E9%99%B3%E7%A7%80%E8%8F%AF+j12.pdf

Comparaison de deux méthodes de résolution d'un problème combinatoire quadratique

Autoři: J. C. Hennet

Zdroj: RAIRO - Operations Research. 17:285-295

Témata: implicit enumeration algorithm, relaxation, 0502 economics and business, 05 social sciences, quadratic performance criterion, Integer programming, combinatorial optimization, Quadratic programming, Dynamic programming

Popis souboru: application/xml

Přístupová URL adresa: https://www.rairo-ro.org/articles/ro/pdf/1983/03/ro1983170302851.pdf
https://zbmath.org/3833708
https://doi.org/10.1051/ro/1983170302851
https://www.rairo-ro.org/articles/ro/abs/1983/03/ro1983170302851/ro1983170302851.html
http://www.rairo-ro.org/articles/ro/abs/1983/03/ro1983170302851/ro1983170302851.html
https://eudml.org/doc/104836
https://www.rairo-ro.org/articles/ro/pdf/1983/03/ro1983170302851.pdf

An algorithm for the solution of the 0–1 knapsack problem: An algorithm for the solution of the 0-1 knapsack problem

Autoři: Didier Fayard Gérard Plateau

Zdroj: Computing. 28:269-287

Témata: Software, source code, etc. for problems pertaining to operations research and mathematical programming, implicit enumeration algorithm, Analysis of algorithms and problem complexity, 0211 other engineering and technologies, 02 engineering and technology, Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.), binary knapsack, 0-1 knapsack problem, Numerical mathematical programming methods, 0202 electrical engineering, electronic engineering, information engineering, Boolean programming, implementation, FPK 79, computational results

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/3735549
https://doi.org/10.1007/bf02241754
http://doi.org/10.1007/BF02241754
https://link.springer.com/article/10.1007/BF02241754
https://dblp.uni-trier.de/db/journals/computing/computing28.html#FayardP82
https://doi.org/10.1007/BF02241754

The Optimal Selection of Small Portfolios: The optimal selection of small portfolios

Autoři: B. Blog G. van der Hoek A. H. G. Rinnooy Kan a další

Zdroj: Management Science. 29:792-798

Témata: implicit enumeration algorithm, negative beta-coefficients, 05 social sciences, finance, 0211 other engineering and technologies, Integer programming, optimal portfolio, 02 engineering and technology, Finance etc, Dynamic programming, Operations research and management science, Markowitz efficiency, negative \beta -coefficients, implicit enumeration, dynamic programming, Applications of mathematical programming, heuristic method, risk-return efficient portfolios, Markowitz efficiency, 0502 economics and business

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/3809269
https://doi.org/10.1287/mnsc.29.7.792
https://ideas.repec.org/a/inm/ormnsc/v29y1983i7p792-798.html
https://www.jstor.org/stable/info/2630969
https://pubsonline.informs.org/doi/10.1287/mnsc.29.7.792

Shortest chain subject to side constraints

Autoři: Yash P. Aneja K. P. K. Nair V. Aggarwal

Zdroj: Networks. 13:295-302

Témata: minimal cost-flow problem, Extremal problems in graph theory, optimal solution, implicit enumeration algorithm, side constraints, 0502 economics and business, 05 social sciences, Deterministic network models in operations research, 0211 other engineering and technologies, shortest chain, 02 engineering and technology, Programming involving graphs or networks

Popis souboru: application/xml

An algorithm for a class of loading problems

Autoři: J. Randall Brown Ming S. Hung

Zdroj: Naval Research Logistics Quarterly. 25:289-297

Témata: Implicid Problem, Implicit Enumeration Algorithm, Numerical mathematical programming methods, Boolean Programming, Loading Problem, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, Computational Study, Boolean programming, 02 engineering and technology

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/3628716
https://doi.org/10.1002/nav.3800250209
https://www.onlinelibrary.wiley.com/doi/pdf/10.1002/nav.3800250209
https://www.onlinelibrary.wiley.com/doi/abs/10.1002/nav.3800250209

A combined approach to solve binary multicriteria problems

Autoři: Gabriel R. Bitran Jorge M. Rivera

Zdroj: Naval Research Logistics Quarterly. 29:181-201

Témata: 0209 industrial biotechnology, Applications of mathematical programming, Numerical mathematical programming methods, implicit enumeration algorithm, facility location, Sensitivity, stability, parametric optimization, 0211 other engineering and technologies, Boolean programming, Inventory, storage, reservoirs, 02 engineering and technology, efficient points in zero-one multiple criteria problems, computational results

Popis souboru: application/xml

Přístupová URL adresa: http://onlinelibrary.wiley.com/doi/10.1002/nav.3800290202/abstract
https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.3800290202
https://ideas.repec.org/a/wly/navlog/v29y1982i2p181-201.html

A Capacitated Bottleneck Facility Location Problem: A capacitated bottleneck facility location problem

Autoři: P. M. Dearing F. C. Newruck

Zdroj: Management Science. 25:1093-1104

Témata: bottleneck, location, Lagrangian relaxation, Applications of mathematical programming, Numerical mathematical programming methods, implicit enumeration algorithm, computation results, 0211 other engineering and technologies, test problems, Inventory, storage, reservoirs, bottleneck transportation cost, 02 engineering and technology, Lagrangean relaxation, capacitated bottleneck facility location

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/3731721
https://doi.org/10.1287/mnsc.25.11.1093
https://ideas.repec.org/a/inm/ormnsc/v25y1979i11p1093-1104.html
https://EconPapers.repec.org/RePEc:inm:ormnsc:v:25:y:1979:i:11:p:1093-1104
https://pubsonline.informs.org/doi/10.1287/mnsc.25.11.1093

A two-process implicit enumeration algorithm for the simple assembly line balancing problem

Autoři: Matthew J. Saltzman Ilker Baybars

Zdroj: European Journal of Operational Research. 32:118-129

Témata: 0209 industrial biotechnology, Deterministic scheduling theory in operations research, networks, implicit-enumeration algorithm, 0211 other engineering and technologies, Integer programming, assembly line balancing, 02 engineering and technology, Production models, 16. Peace & justice, branch-and-bound trees

Popis souboru: application/xml

Přístupová URL adresa: https://www.sciencedirect.com/science/article/pii/0377221787902761
https://econpapers.repec.org/article/eeeejores/v_3a32_3ay_3a1987_3ai_3a1_3ap_3a118-129.htm
http://www.sciencedirect.com/science/article/pii/0377221787902761
https://ideas.repec.org/a/eee/ejores/v32y1987i1p118-129.html

Computational experience with an algorithm for 0–1 integer programming: Computational experience with an algorithm for 0-1 integer programming

Autoři: Anil B. Jambekar David I. Steinberg

Zdroj: Computers & Mathematics with Applications. 4:305-314

Témata: Implicit Enumeration Algorithm, 0211 other engineering and technologies, 02 engineering and technology, 01 natural sciences, Computational Mathematics, All Programming, Numerical mathematical programming methods, Test Problems, Boolean Programming, Computational Theory and Mathematics, Modelling and Simulation, 0103 physical sciences, Computational Study, Boolean programming

Popis souboru: application/xml

Přístupová URL adresa: https://digitalcommons.mtu.edu/michigantech-p/5733/
https://www.sciencedirect.com/science/article/pii/0898122178900111
https://core.ac.uk/display/82032349

A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation

Autoři: Theunis H. C. Smith

Zdroj: Mathematical Programming Studies ISBN: 9783642008016

Témata: algorithmic performance analysis, Specification and verification (program logics, model checking, etc.), Numerical mathematical programming methods, asymmetric travelling salesman problem, LIFO implicit enumeration algorithm, one-arborescence relaxation, Integer programming, comparison of algorithms

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/3679547
https://doi.org/10.1007/bfb0120889
https://rd.springer.com/chapter/10.1007/BFb0120889
https://apps.dtic.mil/sti/pdfs/ADA019800.pdf
https://link.springer.com/chapter/10.1007/BFb0120889

Optimization of the transportation network structure with respect to the flow costs

Autoři: Grabowski, Józef Skubalska, Ewa

Témata: implicit enumeration algorithm, transportation networks, optimal allocation of transportation means, Deterministic network models in operations research, minimal transportation costs, Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.), disjunctive graphs, biminimal flow

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/3922335

An exact algorithm for a class of fixed-cost transportation problems

Autoři: Martinec, Ivan Strnadova, Vlasta

Témata: order-picking operations, epsilon-optimal solution, Numerical mathematical programming methods, implicit enumeration algorithm, Mixed integer programming, Analysis of algorithms and problem complexity, mixed 0-1 integer linear programming, Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.), computational experience, fixed- cost transportation problems, NP-completeness

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/3825567

Decomposition of a network into minimally connected parts

Autoři: Boronin, A. B. Pershin, O. Yu.

Témata: decomposition of a weighted graph, multicomponent network, minimal weight of the external edges, Numerical mathematical programming methods, implicit enumeration algorithm, adaptive branching strategy, Deterministic network models in operations research, Integer programming, connected subgraphs, Programming involving graphs or networks, bounding principle

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/3882231

An implicit enumeration algorithm for the time/cost tradeoff problem in project network analysis

Autoři: Harvey, Richard T. Patterson, James H.

Témata: project management, Applications of mathematical programming, Numerical mathematical programming methods, implicit enumeration algorithm, time/cost tradeoff problem, Deterministic scheduling theory in operations research, Boolean programming, project network analysis, computational experience

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/3661085

Updating a hybrid algorithm for set partitioning problems

Autoři: Campello, R. E.

Témata: set partitioning, Numerical mathematical programming methods, primal cutting plane algorithm, implicit enumeration algorithm, heuristic algorithm, Boolean programming, Computational results

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/3968330

A Massively Parallel Exact Solution Algorithm for the Balanced Minimum Evolution Problem

Autoři: UCL - SSH/LIDAM/CORE - Center for operations research and econometrics Catanzaro, Daniele Frohn, Martin a další

Témata: Combinatorial optimization, network design, balanced minimum evolution, implicit enumeration algorithm, parallel computing, numerical stability, info:eu-repo/semantics/workingPaper

URL: http://hdl.handle.net/2078.1/254728