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

The Application of an Implicit Enumeration Algorithm to the School Desegregation Problem

Autoři: Liggett, Robin Segerblom

Zdroj: Management Science, 1973 Oct 01. 20(2), 159-168.

Přístupová URL adresa: https://www.jstor.org/stable/2629803

An Implicit Enumeration Algorithm for Quadratic Integer Programming

Autoři: McBride, R. D. Yormark, J. S.

Zdroj: Management Science, 1980 Mar 01. 26(3), 282-296.

Přístupová URL adresa: https://www.jstor.org/stable/2630503

An Implicit Enumeration Algorithm for the Machine Sequencing Problem

Autoři: Florian, M. Trepant, P. McMahon, G.

Zdroj: Management Science, 1971 Aug 01. 17(12), B782-B792.

Přístupová URL adresa: https://www.jstor.org/stable/2629469

An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem

Autoři: Florian, M. Robillard, P.

Zdroj: Management Science, 1971 Nov 01. 18(3), 184-193.

Přístupová URL adresa: https://www.jstor.org/stable/2629057

An implicit enumeration algorithm for the hub interdiction median problem with fortification

Autoři: Nader Ghaffarinasab Reza Atayi

Zdroj: European Journal of Operational Research. 267:23-39

Témata: 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Přístupová URL adresa: https://www.sciencedirect.com/science/article/pii/S0377221717310469
https://dblp.uni-trier.de/db/journals/eor/eor267.html#Ghaffari-NasabA18
https://ideas.repec.org/a/eee/ejores/v267y2018i1p23-39.html
https://econpapers.repec.org/RePEc:eee:ejores:v:267:y:2018:i:1:p:23-39
https://doi.org/10.1016/j.ejor.2017.11.035

FPT implicit enumeration of active schedules.

Autoři: Tarhan, İstenç Hanen, Claire Kordon, Alix Munier a další

Zdroj: Discrete Applied Mathematics. Dec2025, Vol. 376, p235-250. 16p.

Témata: *SCHEDULING, *DYNAMIC programming, *TIME complexity, *CONSTRAINED optimization, *COST functions

An Implicit Enumeration Approach for Maximum Ratio Clique Relaxations.

Autoři: Blokhin, Yehor Butenko, Sergiy Makovenko, Mykyta a další

Zdroj: Networks; Oct2025, Vol. 86 Issue 3, p241-262, 22p

Témata: GRAPH theory, GRAPH algorithms, MIXED integer linear programming, ALGORITHMS, QUANTITATIVE research

An Implicit Enumeration Algorithm to Optimize the Preparation of Shunting Plan of Intermediate Station

Autoři: Wenjia Zheng Yan Sun Liucheng Sun

Zdroj: CICTP 2017. :1897-1908

Přístupová URL adresa: https://ascelibrary.org/doi/abs/10.1061/9780784480915.200

An implicit enumeration algorithm for the passenger service planning problem: Application to the Taiwan Railways Administration line

Autoři: Yu Hsiung Ku Dung Ying Lin

Zdroj: European Journal of Operational Research. 238:863-875

Témata: 0502 economics and business, 05 social sciences, 11. Sustainability, 0211 other engineering and technologies, 02 engineering and technology, 3. Good health

Přístupová URL adresa: https://ideas.repec.org/a/eee/ejores/v238y2014i3p863-875.html
https://www.sciencedirect.com/science/article/abs/pii/S0377221714003518#!
https://www.sciencedirect.com/science/article/pii/S0377221714003518
https://EconPapers.repec.org/RePEc:eee:ejores:v:238:y:2014:i:3:p:863-875
https://researchoutput.ncku.edu.tw/zh/publications/an-implicit-enumeration-algorithm-for-the-passenger-service-plann
https://dblp.uni-trier.de/db/journals/eor/eor238.html#LinK14a

Analysis of multiechelon maintenance network characteristics using implicit enumeration algorithm

Autoři: Christian N. Madu Chu-Hua Kuei

Zdroj: Mathematical and Computer Modelling. 24:79-92

Témata: Applications of mathematical programming, Reliability, availability, maintenance, inspection in operations research, Applications of Markov renewal processes (reliability, queueing networks, etc.), closed queueing maintenance network, Modelling and Simulation, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, multiechelon repairable system, 02 engineering and technology, load independent servers, Queues and service in operations research, Buzen's algorithm, Computer Science Applications

Popis souboru: application/xml

Přístupová URL adresa: https://www.sciencedirect.com/science/article/pii/089571779600101X
https://www.sciencedirect.com/science/article/abs/pii/089571779600101X

Combining a multidimensional risk evaluation with an implicit enumeration algorithm to tackle the portfolio selection problem of a natural gas pipeline

Autoři: Ramon Swell Gomes Rodrigues Casado Marcelo Hazin Alencar Adiel Teixeira de Almeida

Zdroj: Reliability Engineering & System Safety. 221:108332

Témata: 0211 other engineering and technologies, 02 engineering and technology

An implicit enumeration algorithm for arrival aircraft

Autoři: C.R. Brinton

Zdroj: [1992] Proceedings IEEE/AIAA 11th Digital Avionics Systems Conference. :268-274

Témata: 0502 economics and business, 05 social sciences, 0211 other engineering and technologies, 02 engineering and technology

Přístupová URL adresa: https://ieeexplore.ieee.org/document/282145/
http://ieeexplore.ieee.org/document/282145/

Input, output and graph technical efficiency measures on non-convex FDH models with various scaling laws: An integrated approach based upon implicit enumeration algorithms

Autoři: Walter Briec Kristiaan Kerstens

Zdroj: Top. 14:135-166

Témata: Data Envelopment Analysis, Free Disposal Hull, technical efficiency, 0502 economics and business, 05 social sciences, 0211 other engineering and technologies, 02 engineering and technology

Přístupová URL adresa: https://dialnet.unirioja.es/servlet/articulo?codigo=2128811
https://link.springer.com/article/10.1007/BF02579006
https://EconPapers.repec.org/RePEc:spr:topjnl:v:14:y:2006:i:1:p:135-166
https://hal.archives-ouvertes.fr/hal-00211169v1
https://ideas.repec.org/a/spr/topjnl/v14y2006i1p135-166.html
http://my.ieseg.fr/bienvenue/DownloadDoc.asp?Fich=14417059_2005-ECO-4_Briec_Kerstens.pdf

A Genetic Algorithm for the Set Covering Problem

Autoři: Al-Sultan, K. S. Hussain, M. F. Nizami, J. S.

Zdroj: The Journal of the Operational Research Society, 1996 May 01. 47(5), 702-709.

Přístupová URL adresa: https://www.jstor.org/stable/3010021

Implicit enumeration algorithms for the Set-Partitioning Problem: Implicit enumeration algorithms for the set-partitioning problem

Autoři: S. Albers

Zdroj: Operations-Research-Spektrum. 2:23-32

Témata: Analysis of algorithms and problem complexity, 05 social sciences, 0211 other engineering and technologies, 02 engineering and technology, set-partitioning problem, computational experiences, Numerical mathematical programming methods, column enumeration algorithm, branch-and-bound concept, 0502 economics and business, lower bound concept, Boolean programming, comparison of algorithms, preordering of the variables, implicit enumeration algorithms

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/3691063
https://doi.org/10.1007/bf01720155
https://link.springer.com/content/pdf/10.1007%2FBF01720155.pdf
https://link.springer.com/article/10.1007/BF01720155

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

A massively parallel branch-&-bound algorithm for the balanced minimum evolution problem

Autoři: Catanzaro, Daniele Frohn, Martin Gascuel, Olivier a další

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

Zdroj: Computers & Operations Research, Vol. 158, p. 106308 (2023)
Computers & Operations Research

Témata: [SDV] Life Sciences [q-bio], Balanced minimum evolution problem, Combinatorial optimization, Parallel branch-and-bound, Integer programming, [MATH] Mathematics [math], [INFO] Computer Science [cs], Combinatorial optimization, network design, balanced minimum evolution, implicit enumeration algorithms, parallel computing, numerical stability, Network design

Popis souboru: application/pdf

Přístupová URL adresa: https://hdl.handle.net/2078.1/278715

A group theoretic-implicit enumeration algorithm for the traveling salesman problem.

Autoři: Jeremy F. Shapiro. Sloan School of Management. Baxter, Wayne Walter

Témata: Sloan School of Management., Thesis

URL: http://hdl.handle.net/1721.1/103825

The Set-Covering Problem: A New Implicit Enumeration Algorithm: The set-covering problem: A new implicit enumeration algorithm

Autoři: Javier Etcheberry

Zdroj: Operations Research. 25:760-772

Témata: Numerical mathematical programming methods, Linear programming, Analysis of algorithms and problem complexity, Exact enumeration problems, generating functions, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, Boolean programming, 02 engineering and technology, Combinatorial aspects of packing and covering

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/3596581
https://doi.org/10.1287/opre.25.5.760

An Implicit Enumeration Algorithm for Quadratic Integer Programming: An implicit enumeration algorithm for quadratic integer programming

Autoři: R. D. McBride J. S. Yormark

Zdroj: Management Science. 26:282-296

Témata: pseudo-costs, nonlinear extension, 0211 other engineering and technologies, quadratic integer programming, implicit enumeration method, 02 engineering and technology, Quadratic programming, Lemke's complementary pivot method, parametric penalties, Numerical mathematical programming methods, 0202 electrical engineering, electronic engineering, information engineering, Boolean programming, implicit upper bounding, guide branching

Popis souboru: application/xml

Přístupová URL adresa: http://ideas.repec.org/a/inm/ormnsc/v26y1980i3p282-296.html
https://ideas.repec.org/a/inm/ormnsc/v26y1980i3p282-296.html
https://www.jstor.org/stable/2630503
https://pubsonline.informs.org/doi/abs/10.1287/mnsc.26.3.282