Výsledky vyhľadávania - cutting plane/branch and bound algorithm

A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing

Autori: Nemhauser, G. L. Sigismondi, G.

Zdroj: The Journal of the Operational Research Society, 1992 May 01. 43(5), 443-457.

Prístupová URL adresa: https://www.jstor.org/stable/2583564

A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing: A strong cutting plane/branch-and-bound algorithm for node packing

Autori: George L. Nemhauser Gabriele Sigismondi

Zdroj: Journal of the Operational Research Society. 43:443-457

Predmety: Computational methods for problems pertaining to operations research and mathematical programming, 0211 other engineering and technologies, node packing, Integer programming, cutting plane/branch-and-bound algorithm, heuristics, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, 01 natural sciences

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/90327
https://doi.org/10.1057/jors.1992.71
https://link.springer.com/content/pdf/10.1057%2Fjors.1992.71.pdf
https://rd.springer.com/content/pdf/10.1057%2Fjors.1992.71.pdf
https://link.springer.com/article/10.1057/jors.1992.71
https://www.tandfonline.com/doi/abs/10.1057/jors.1992.71

Some improvements in a cutting plane/branch and bound algorithm

Autori: Šorić, Kristina Scitovski, Rudolf Hunjak, Tihomir

Prispievatelia: Šorić, Kristina Scitovski, Rudolf Hunjak, Tihomir

Predmety: mixed 0-1 programming problem, single machine scheduling, valid inequalities, cutting plane/branch and bound algorithm

Prístupová URL adresa: https://www.bib.irb.hr/34794

A cutting plane algorithm for a single machine scheduling problem

Autori: Kristina Šorić Burkard, E. Rainer Leopold-Wildburger, Ulrike a ďalší

Prispievatelia: Kristina Šorić Burkard, E. Rainer Leopold-Wildburger, Ulrike a ďalší

Zdroj: European Journal of Operational Research. 127:383-393

Predmety: mixed 0-1 programming problem, single machine scheduling, valid inequalities, branch and bound/cutting plane algorithm, Combinatorial optimization, cutting plane/branch and bound algorithm, Deterministic scheduling theory in operations research, 0211 other engineering and technologies, 02 engineering and technology, cutting plane algorithm, mixed \(0-1\) programming problem, single machine scheduling problem, Mixed integer programming, Polyhedral combinatorics, branch-and-bound, branch-and-cut

Popis súboru: application/xml

Prístupová URL adresa: https://www.bib.irb.hr/39061
https://www.bib.irb.hr/34889
https://www.bib.irb.hr/34890
https://zbmath.org/1545199
https://doi.org/10.1016/s0377-2217(99)00493-2
https://elibrary.ru/item.asp?id=413897
https://ideas.repec.org/a/eee/ejores/v127y2000i2p383-393.html
https://dblp.uni-trier.de/db/journals/eor/eor127.html#Soric00
http://www.sciencedirect.com/science/article/pii/S0377221799004932
https://www.sciencedirect.com/science/article/pii/S0377221799004932
https://EconPapers.repec.org/RePEc:eee:ejores:v:127:y:2000:i:2:p:383-393

Fractional Cutting Plane : Branch & Bound Algorithm / 電力設備補修計画における切除平面/分枝限定法

Autori: Mikio Kubo Takayuki Shiina 久保 幹雄 a ďalší

Zdroj: 日本応用数理学会論文誌 / Transactions of the Japan Society for Industrial and Applied Mathematics. 1998, 8(2):157

Applicability of deterministic global optimization to the short-term hydrothermal coordination problem

Autori: Ferrer Biosca, Alberto

Prispievatelia: University/Department: Universitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa

Thesis Advisors: Nabona, Narcís

Zdroj: TDX (Tesis Doctorals en Xarxa)

Predmety: global optimization, optimization, outer approximation, branch and bound, prismatical subdivision, semi-infinite quadratic program, d.c. presentation, 1207. Investigació operativa

Popis súboru: application/pdf

Prístupová URL adresa: http://www.tdx.cat/TDX-0928105-135935
http://hdl.handle.net/10803/6516
https://dx.doi.org/10.5821/dissertation-2117-93827

A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs

Autori: Magnanti, Thomas L. Vachani, Rita

Témy: Working Paper

URL: http://hdl.handle.net/1721.1/5192
Operations Research Center Working Paper;OR 173-87

Cutting Plane and Branch and Bound for Solving a Class of Scheduling Problems.

Autori: Wolfe, Carvel S.

Zdroj: IIE Transactions; Mar84, Vol. 16 Issue 1, p50-58, 9p

Predmety: PRODUCTION scheduling, ALGORITHMS, MATHEMATICAL programming, DYNAMIC programming, INTEGER programming, LINEAR programming

A cutting plane algorithm for a single machine scheduling problem.

Autori: Soríc, Kristina¹ ksoric@efzg.hr

Zdroj: European Journal of Operational Research. 12/01/2000, Vol. 127 Issue 2, p383-393. 11p. 2 Charts.

Predmety: *ALGORITHMS, *OPERATIONS research, *RESEARCH

水下训练服浮力配平的 整数非线性规划方法. (Chinese)

Alternate Title: An Integer Nonlinear Programming Method for Underwater Training Spacesuit Buoyancy Balancing. (English)

Autori: 彭扬林 马爱军 刘洪英 a ďalší

Zdroj: Applied Mathematics & Mechanics (1000-0887); Mar2020, Vol. 41 Issue 3, p260-267, 8p

Predmety: BRANCH & bound algorithms, INTEGER programming, BUOYANCY, NONLINEAR programming

A Branch and Bound Algorithm for the Stability Number of a Sparse Graph.

Autori: Sewell, E.C.

Zdroj: INFORMS Journal on Computing; Fall98, Vol. 10 Issue 4, p438, 10p, 8 Charts

Predmety: ALGORITHMS, POLYTOPES

Facets and Algorithms for Capacitated Lot Sizing

Autori: Leung, Janny M. Y. Magnanti, Thomas L. Vachani, Rita

Témy: Working Paper

URL: http://hdl.handle.net/1721.1/5210
Operations Research Center Working Paper;OR 171-87

A cutting plane approach to capacitated lot-sizing with start-up costs

Autori: UCL - EUEN/CORE - Center for operations research and econometrics Constantino, Miguel Fragoso

Zdroj: Mathematical Programming, Vol. 75, no. 3, p. 353-376 (1996)

Témy: capacitated lot-sizing, start-up costs, valid inequalities, cutting plane algorithm, info:eu-repo/semantics/article

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

The Transformer Network for the Traveling Salesman Problem

Autori: Bresson, Xavier Laurent, Thomas

Témy: Computer Science - Machine Learning, text

URL: http://arxiv.org/abs/2103.03012

A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs

Autori: Magnanti, Thomas L. Vachani, Rita

Popis súboru: 2257793 bytes; application/pdf

Relation: Operations Research Center Working Paper;OR 173-87

Dostupnosť: http://hdl.handle.net/1721.1/5192

A LOGISTICAL BUILD-UP PROBLEM SOLVED BY A HYBRID M.I.P. - ALGORITHM.

Autori: Hugo, Pastijn¹

Zdroj: Engineering & Process Economics. Jun79, Vol. 4 Issue 2/3, p313-323. 11p.

Predmety: *STOCKS (Finance), *ALGORITHMS, *LINEAR programming, *QUALITY control, *COST, PSYCHOLOGY

An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation.

Autori: Baldacci, R. Hadjiconstantinou, E. Mingozzi, A.

Zdroj: Operations Research. Sep/Oct2004, Vol. 52 Issue 5, p723-738. 16p. 3 Diagrams, 6 Charts.

Predmety: *PLANT capacity, *INTEGER programming, *LINEAR programming, *PRODUCTION management (Manufacturing), ROUTING-machines, BRANCH & bound algorithms

A STRONG CUTTING PLANE ALGORITHM FOR PRODUCTION SCHEDULING WITH CHANGEOVER COSTS.

Autori: Magnanti, T. L. Vachani, R.

Zdroj: Operations Research. May/Jun1990, Vol. 38 Issue 3, p456. 18p.

Predmety: *PRODUCTION scheduling, *FACTORY management, *PRODUCTION management (Manufacturing), *LINEAR programming, *COST effectiveness, *MANUFACTURING processes, *DYNAMIC programming, MATRICES (Mathematics)

A time indexed formulation of non-preemptive single machine scheduling problems.

Autori: Sousa, Jorge Wolsey, Laurence

Zdroj: Mathematical Programming; Feb1992, Vol. 54 Issue 1-3, p353-367, 15p

Global Concave Minimization for Optimal Spectrum Balancing in Multi-User DSL Networks.

Autori: Yang Xu Tho Le-Ngoc Saswat Panigrahi

Zdroj: IEEE Transactions on Signal Processing; Jul2008 Part 1, Vol. 56 Issue 7, p2875-2885, 11p, 2 Diagrams, 3 Charts, 6 Graphs

Predmety: SPECTRUM analysis, CROSSTALK, TELECOMMUNICATION, DIGITAL subscriber lines, DIGITAL communications