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

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

A Lifo Implicit Enumeration Search Algorithm for the Symmetric Traveling Salesman Problem Using Held and Karp's 1-Tree Relaxation

Autoři: T. H. C. Smith G. L. Thompson

Přístupová URL adresa: https://www.sciencedirect.com/science/article/pii/S0167506008707544
http://www.sciencedirect.com/science/article/pii/S0167506008707544

A LIFO Implicit Enumeration Algorithm for the Asymmetric Traveling Salesman Problem Using a One-Arborescence Relaxation.

Autoři: CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP Smith,Theunis H. C.

Zdroj: DTIC AND NTIS

Témata: Operations Research, Integer programming, Mathematical models, Algorithms, Computations, FORTRAN, Traveling salesman problem, Graph theory, Minimum spanning trees, Implicit enumeration, Text

URL: https://apps.dtic.mil/docs/citations/ADA019800

A LIFO Implicit Enumeration Algorithm for the Asymmetric Traveling Salesman Problem Using a One-Arborescence Relaxation.

Autoři: Smith,Theunis H. C. CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP

Přispěvatelé: Smith,Theunis H. C. CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP

Zdroj: DTIC AND NTIS

Témata: Operations Research, Integer programming, Mathematical models, Algorithms, Computations, FORTRAN, Traveling salesman problem, Graph theory, Minimum spanning trees, Implicit enumeration

Popis souboru: text/html

Relation: http://www.dtic.mil/docs/citations/ADA019800

Dostupnost: http://www.dtic.mil/docs/citations/ADA019800
http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA019800

The Set-Covering Problem: A New Implicit Enumeration Algorithm.

Autoři: Etcheberry, Javier

Zdroj: Operations Research; Sep/Oct1977, Vol. 25 Issue 5, p760, 13p

Témata: ALGORITHMS, MATHEMATICAL optimization, LINEAR programming, PROBLEM solving, MULTIPLIERS (Mathematical analysis), LISTS, EQUATIONS, OPERATIONS research

AN IMPLICIT ENUMERATION ALGORITHM FOR QUADRATIC INTEGER PROGRAMMING.

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

Zdroj: Management Science; Mar80, Vol. 26 Issue 3, p282-296, 15p

Témata: QUADRATIC programming, INTEGER programming, ALGORITHMS, MATHEMATICAL programming, MATHEMATICAL optimization, OPERATIONS research, BRANCH & bound algorithms, LINEAR programming, NETWORK analysis (Planning), MANAGEMENT science, PROBLEM solving, MATHEMATICAL analysis

An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits.

Autoři: Goel

Zdroj: IEEE Transactions on Computers; 1981, Vol. C-30 Issue 3, p215-222, 8p

AN IMPLICIT ENUMERATION ALGORITHM TO GENERATE TESTS FOR COMBINATIONAL LOGIC CIRCUITS.

Autoři: Goel, P.

Zdroj: Twenty-Fifth International Symposium on Fault-Tolerant Computing, 1995, ' Highlights from Twenty-Five Years'; 1995, p337-337, 1p

Implicit enumeration algorithms for the Set-Partitioning Problem.

Autoři: Albers, S.

Zdroj: OR Spectrum; Dec1980, Vol. 2 Issue 1, p23-32, 10p

A zero-one implicit enumeration method for optimizing investments in transmission expansion planning.

Autoři: Romero, R. Monticelli, A.

Zdroj: IEEE Transactions on Power Systems; 1994, Vol. 9 Issue 3, p1385-1391, 7p

Some new perspectives for solving 0–1 integer programming problems using Balas method.

Autoři: Glover, J. Quan, V. Zolfaghari, S.

Zdroj: Computational Management Science; Jun2021, Vol. 18 Issue 2, p177-193, 17p

Témata: INTEGER programming, LINEAR programming, BOOKKEEPING

DYNAMIC OPTIMIZATION MODEL TO CONTROL WEED INFESTATION: A MIXED-INTEGER NONLINEAR PROGRAMMING APPROACH.

Autoři: STIEGELMEIER, ELENICE WEBER OLIVEIRA, VILMA ALVES SILVA, GERALDO NUNES a další

Zdroj: Advances in Mathematical Sciences & Applications; 2022, Vol. 31 Issue 1, p175-196, 22p

Témata: WEED control, NONLINEAR programming, DYNAMIC models, HERBICIDE resistance, HERBICIDES, DAMAGES (Law)

A boosted sine cosine algorithm with dimension learning-based search and terminal replacement mechanism for optimization and engineering applications.

Autoři: Huang, Wei Chen, Huiling Heidari, Ali Asghar a další

Zdroj: Evolving Systems; Jun2025, Vol. 16 Issue 2, p1-38, 38p

Integrated Learning and Optimization for Joint Routing and Loading Decisions in Preowned Automobile Shipping.

Autoři: Sun, Yanshuo Kirtonia, Sajeeb Chen, Zhi-Long

Zdroj: Transportation Science; Sep/Oct2025, Vol. 59 Issue 5, p1076-1100, 25p

Témata: MATHEMATICAL optimization, MACHINE learning, ROUTING systems, COST control, USED cars, SHIPPING rates

Job shop scheduling with genetic algorithm-based hyperheuristic approach.

Autoři: Akarsu, Canan Hazal Küçükdeniz, Tarık

Zdroj: International Advanced Researches & Engineering Journal (IAREJ); Apr2022, Vol. 6 Issue 1, p16-25, 10p

Témata: JOB shops, MANUFACTURING processes, GENETIC algorithms, INDUSTRIAL efficiency, COST effectiveness

Nonblock Coding of Binary Sources by Probabilistic Enumeration.

Autoři: Teuhola, Jukka

Zdroj: IEEE Transactions on Information Theory; Sep2011, Vol. 57 Issue 9, p6170-6179, 10p

Témata: CODING theory, BINARY number system, PROBABILITY theory, COMBINATORICS, ASYMPTOTIC expansions, INFORMATION theory

Coordinated scheduling of production and transportation in a two-stage assembly flowshop.

Autoři: Wang, K. Ma, W.Q. Luo, H. a další

Zdroj: International Journal of Production Research; Nov2016, Vol. 54 Issue 22, p6891-6911, 21p, 11 Diagrams, 9 Charts, 5 Graphs

Témata: SUPPLY chains, PRODUCTION (Economic theory), DISTRIBUTION (Economic theory), MATHEMATICAL models, SCHEDULING, MATHEMATICAL programming, COMPUTATIONAL complexity, GENETIC algorithms, HEURISTIC programming

Exponential-Size Neighborhoods for the Pickup-and-Delivery Traveling Salesman Problem.

Autoři: Pacheco, Toni Martinelli, Rafael Subramanian, Anand a další

Zdroj: Transportation Science; Mar/Apr2023, Vol. 57 Issue 2, p463-481, 19p

Témata: TRAVELING salesman problem, METAHEURISTIC algorithms, DYNAMIC programming, NEIGHBORHOODS

Geografický termín: RIO de Janeiro (Brazil)

Parallel distributed productivity‐aware tree‐search using Chapel.

Autoři: Helbecque, Guillaume Gmys, Jan Melab, Nouredine a další

Zdroj: Concurrency & Computation: Practice & Experience; 12/10/2023, Vol. 35 Issue 27, p1-19, 19p

Témata: DATA structures, SOFTWARE productivity, FLOW shop scheduling, CHAPELS, PROGRAMMING languages

A New Formulation for the Dial-a-Ride Problem.

Autoři: Rist, Yannik Forbes, Michael A.

Zdroj: Transportation Science; Sep/Oct2021, Vol. 55 Issue 5, p1113-1135, 23p

Témata: PARATRANSIT services, PROBLEM solving, ALGORITHMS, INTEGER programming, MAGNITUDE (Mathematics)