Suchergebnisse - "constraint integer programming"

Enabling Research through the SCIP Optimization Suite 8.0

Autoren: Ksenia Bestuzheva Mathieu Besançon Wei-Kun Chen et al.

Quelle: ACM Transactions on Mathematical Software. 49:1-21

Schlagwörter: column generation, mixed-integer semidefinite programming, 0211 other engineering and technologies, linear programming, 02 engineering and technology, 01 natural sciences, Constraint integer programming, 90C05, 90C10, 90C11, 90C30, 90C90, 65Y05, branch-and-cut, branch-and-price, Optimization and Control (math.OC), parallelization, FOS: Mathematics, mixed-integer linear programming, optimization solver, 0101 mathematics, mixed-integer nonlinear programming, Mathematics - Optimization and Control

Zugangs-URL: http://arxiv.org/abs/2303.07101
https://research.tue.nl/en/publications/7cede53c-64b8-4eba-a2c0-1b3e439b780c
https://doi.org/10.1145/3585516

Implementing the branch-and-cut approach for a general purpose Benders’ decomposition framework

Autoren: Maher, SJ

Quelle: European Journal of Operational Research. 290:479-498

Schlagwörter: 0209 industrial biotechnology, branch-and-cut, 0211 other engineering and technologies, Benders' decomposition, constraint integer programming, 02 engineering and technology, optimisation software, mixed integer programming

The SCIP Optimization Suite 7.0

Autoren: Gamrath, Gerald Anderson, Daniel Bestuzheva, Ksenia et al.

Quelle: Gamrath, G, Anderson, D, Bestuzheva, K, Chen, W-K, Eifler, L, Gasse, M, Gemander, P, Gleixner, A, Gottwald, L, Halbig, K, Hendel, G, Hojny, C, Koch, T, Le Bodic, P, Maher, S J, Matter, F, Miltenberger, M, Mühmer, E, Müller, B, Pfetsch, M E, Schlösser, F, Serrano, F, Shinano, Y, Tawfik, C, Vigerske, S, Wegscheider, F, Weninger, D & Witzig, J 2020, The SCIP Optimization Suite 7.0. ZIB-Report, vol. 20-10, Zuse Institut Berlin, Berlin. < http://www.optimization-online.org/DB_HTML/2020/03/7705.html >

Schlagwörter: Constraint integer programming, linear programming, mixed-integer linear programming, mixed-integer nonlinear programming, optimization solver, branch-and-cut, branch-and-price, column generation, Benders' decomposition, parallelization, mixed-integer semidefinite programming

Verfügbarkeit: https://research.tue.nl/en/publications/ef240efe-4cc5-4e73-b420-6c2a1bbd1c24
http://www.optimization-online.org/DB_HTML/2020/03/7705.html

Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework (article)

Autoren: SJ Maher

Schlagwörter: Benders' decomposition, branch-and-cut, mixed integer programming, constraint integer programming, optimisation software

Relation: 10871/122573

Verfügbarkeit: https://figshare.com/articles/journal_contribution/Implementing_the_branch-and-cut_approach_for_a_general_purpose_Benders_decomposition_framework_article_/29772917

A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling

Autoren: Berthold, Timo Heinz, Stefan Lübbecke, Marco E. et al.

Schlagwörter: 510 Mathematik, scheduling, resource-constrained, constraint integer programming, hybrid approach

Dateibeschreibung: application/pdf

Verfügbarkeit: https://depositonce.tu-berlin.de/handle/11303/15701
https://doi.org/10.14279/depositonce-14474

Modeling energy consumption in automated vacuum waste collection systems

Autoren: Cèsar Fernández Felip Manyà Carles Mateu et al.

Weitere Verfasser: Cèsar Fernández Felip Manyà Carles Mateu et al.

Quelle: Repositori Obert UdL
instname
Digital.CSIC. Repositorio Institucional del CSIC
Consejo Superior de Investigaciones Científicas (CSIC)
Repositorio Abierto de la UdL
Universitad de Lleida
Recercat. Dipósit de la Recerca de Catalunya

Schlagwörter: Energy utilization, Smart city, Artificial intelligence, Vacuum, Waste collection, Electronic commerce, 0211 other engineering and technologies, 0207 environmental engineering, Integer programming, 02 engineering and technology, 7. Clean energy, 12. Responsible consumption, Greenhouse gases, Computational sustainability, Sustainability, 13. Climate action, Sustainable development, 11. Sustainability, Constraint integer programming (CIP), Drops, Smart cities

Zugangs-URL: https://repositori.udl.cat/bitstream/10459.1/57201/5/020644.pdf
http://hdl.handle.net/10261/131903
http://hdl.handle.net/10459.1/57201

Spectrum Sharing in Cognitive Radio Systems Under Outage Probablility Constraint

Autoren: Cai, Pei Li

Thesis Advisors: Cui, Shuguang

Schlagwörter: Cognitive Radio (CR), Spectrum Sharing, Convex Optimization, Branch and Bound, Probabilistic Constraint, Integer Programming.

Dateibeschreibung: application/pdf

Verfügbarkeit: http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7463

The SCIP Optimization Suite 8.0.0

Autoren: Bestuzheva, Ksenia orcid:0000-0002-7018- Besançon, Mathieu et al.

Schlagwörter: constraint integer programming, linear programming, mixed-integer linear programming, mixed-integer nonlinear programming, optimization solver, branch-and- cut, branch-and-price, column generation, parallelization, mixed-integer semidefinite programming

Relation: https://zenodo.org/communities/scip-optimization-suite/; https://zenodo.org/records/6414728; oai:zenodo.org:6414728; https://doi.org/10.5281/zenodo.6414728

Verfügbarkeit: https://doi.org/10.5281/zenodo.6414728
https://zenodo.org/records/6414728

Implementing the branch-and-cut approach for a general purpose Benders’ decomposition framework - Computational results

Autoren: S Maher

Schlagwörter: Benders' decomposition, branch-and-cut, mixed integer programming, constraint integer programming, optimisation software

Verfügbarkeit: https://doi.org/10.24378/exe.1863
https://figshare.com/articles/dataset/Implementing_the_branch-and-cut_approach_for_a_general_purpose_Benders_decomposition_framework_-_Computational_results/29760887

scipopt/scip: v8.0.0

Autoren: Bestuzheva, Ksenia orcid:0000-0002-7018- Besançon, Mathieu et al.

Schlagwörter: constraint integer programming, linear programming, mixed-integer linear programming, mixed-integer nonlinear programming, optimization solver, branch-and- cut, branch-and-price, parallelization, mixed-integer semidefinite programming

Relation: https://github.com/scipopt/scip/tree/v800; https://zenodo.org/communities/scip-optimization-suite/; https://zenodo.org/records/6414876; oai:zenodo.org:6414876; https://doi.org/10.5281/zenodo.6414876

Verfügbarkeit: https://doi.org/10.5281/zenodo.6414876
https://zenodo.org/records/6414876

Decomposition in multistage stochastic programming and a constraint integer programming approach to mixed-integer nonlinear programming

Autoren: Vigerske, Stefan

Thesis Advisors: Römisch, Werner, Schultz, Rüdiger, Bonami, Pierre

Schlagwörter: Optimierung, Stabilität, Mathematische Programmierung, stochastische Optimierung, gemischt-ganzzahlige nichtlineare Optimierung, MINLP, constraint ganzzahlige Optimierung, Dekomposition, rekombinierende Szenariobäume, äußere Approximation, Relaxierung, Löser, Konvexifizierung, Reformulierung, mathematical programming, stability, optimization, stochastic programming, mixed-integer nonlinear programming, constraint integer programming, decomposition, recombining scenario tree, outer-approximation, relaxation, solver, convexification, reformulation, branch-and-bound, 510 Mathematik, 27 Mathematik, SK 800, ddc:510

Dateibeschreibung: application/pdf

Verfügbarkeit: http://edoc.hu-berlin.de/18452/17356

Hybrid Solving Techniques for Project Scheduling Problems ; Hybride Lösungstechniken für Projektschedulingprobleme

Autoren: Schulz, Jens Möhring, Rolf Technische Universität Berlin, Fakultät II - Mathematik und Naturwissenschaften

Weitere Verfasser: Schulz, Jens Möhring, Rolf Technische Universität Berlin, Fakultät II - Mathematik und Naturwissenschaften

Schlagwörter: 510 Mathematik, Hybride Lösungsverfahren, Projektscheduling, Constraint Integer Programming, Scheduling

Dateibeschreibung: application/pdf

Verfügbarkeit: https://depositonce.tu-berlin.de/handle/11303/3899
https://nbn-resolving.org/urn:nbn:de:kobv:83-opus-39956
https://doi.org/10.14279/depositonce-3602

Demonstrace skákajících automatů ; Demonstrations of Jumping Automata

Autoren: Růžička, Ladislav Křivka, Zbyněk Kocman, Radim

Weitere Verfasser: Růžička, Ladislav Křivka, Zbyněk Kocman, Radim

Schlagwörter: skákající konečný automat, obecný skákající automat, problém členství, celočíselné linearní programování, podmínkové celočíselné programování, zpětné navrácení, heuristiky, jumping finite automata, general jumping finite automata, membership problem, integer linear programming, constraint integer programming, backtrack, heuristics

Dateibeschreibung: application/pdf; text/html

Relation: RŮŽIČKA, L. Demonstrace skákajících automatů [online]. Brno: Vysoké učení technické v Brně. Fakulta informačních technologií. 2017.; 106362; http://hdl.handle.net/11012/69461

Verfügbarkeit: http://hdl.handle.net/11012/69461

Hybrid Solving Techniques for Project Scheduling Problems ; Hybride Lösungstechniken für Projektschedulingprobleme ; Hybrid Solving Techniques for Project Scheduling Problem; Hybrid solving techniques for project scanning problems

Autoren: Schulz, Jens Möhring, Rolf Technische Universität Berlin, Fakultät II - Mathematik und Naturwissenschaften

Weitere Verfasser: Schulz, Jens Möhring, Rolf Technische Universität Berlin, Fakultät II - Mathematik und Naturwissenschaften

Schlagwörter: 510 Mathematik, Hybride Lösungsverfahren, Projektscheduling, Constraint Integer Programming, Scheduling, envir, info

Relation: http://depositonce.tu-berlin.de/handle/11303/3899

Verfügbarkeit: http://depositonce.tu-berlin.de/handle/11303/3899

Hybrid Solving Techniques for Project Scheduling Problems

Autoren: Schulz, Jens Möhring, Rolf

Weitere Verfasser: Schulz, Jens Möhring, Rolf

Verfügbarkeit: http://data.europeana.eu/aggregation/europeana/2048441/item_SUFNREH4JCH5CMKAA764MXMB36KAI4M6
http://data.europeana.eu/item/2048441/item_SUFNREH4JCH5CMKAA764MXMB36KAI4M6

Decomposition in multistage stochastic programming and a constraint integer programming approach to mixed-integer nonlinear programming

Autoren: Vigerske, Stefan Römisch, Werner Schultz, Rüdiger et al.

Weitere Verfasser: Vigerske, Stefan Römisch, Werner Schultz, Rüdiger et al.

Verfügbarkeit: http://data.europeana.eu/aggregation/europeana/2048441/item_OWTZE4BDST4RP4PVQ2LWRJJ3GDULO52K
http://data.europeana.eu/item/2048441/item_OWTZE4BDST4RP4PVQ2LWRJJ3GDULO52K

Enabling Research Through The SCIP Optimization Suite 8.0

Autoren: Bestuzheva, Ksenia Besancon, Mathieu Chen, Wei-Kun et al.

Quelle: ACM Transactions on Mathematical Software vol.49 (2023) date: 2023-06-15 nr.2 p.1-21 [ISSN 0098-3500]

Index Begriffe: Constraint integer programming, branch-and-cut, branch-and-price, column generation, linear programming, mixed-integer linear programming, mixed-integer nonlinear programming, mixed-integer semidefinite programming, optimization solver, parallelization, Tijdschriftartikel, Article

URL: https://research.tue.nl/en/publications/7cede53c-64b8-4eba-a2c0-1b3e439b780c

Modeling energy consumption in automated vacuum waste collection systems

Autoren: Ministerio de Economía y Competitividad (España) Ministerio de Ciencia e Innovación (España) Fernández, César et al.

Index Begriffe: Sustainable development, Integer programming, Vacuum, Computational sustainability, Constraint integer programming (CIP), Smart cities, Sustainability, Waste collection, Drops, Electronic commerce, Greenhouse gases, Energy utilization, artículo

URL: http://hdl.handle.net/10261/131903
Sí

Decomposition in multistage stochastic programming and a constraint integer programming approach to mixed-integer nonlinear programming

Autoren: Römisch, Werner Schultz, Rüdiger Bonami, Pierre et al.

Index Begriffe: Optimierung, Stabilität, Mathematische Programmierung, stochastische Optimierung, gemischt-ganzzahlige nichtlineare Optimierung, MINLP, constraint ganzzahlige Optimierung, Dekomposition, rekombinierende Szenariobäume, äußere Approximation, Relaxierung, Löser, Konvexifizierung, Reformulierung, mathematical programming, stability, optimization, stochastic programming, mixed-integer nonlinear programming, constraint integer programming, decomposition, recombining scenario tree, outer-approximation, relaxation, solver, convexification, reformulation, branch-and-bound, 510 Mathematik, 27 Mathematik, SK 800, ddc:510, doctoralThesis, doc-type:doctoralThesis

URL: http://edoc.hu-berlin.de/18452/17356

Demonstrace skákajících automatů

Autoren: Křivka, Zbyněk Kocman, Radim Růžička, Ladislav

Index Begriffe: skákající konečný automat, obecný skákající automat, problém členství, celočíselné linearní programování, podmínkové celočíselné programování, zpětné navrácení, heuristiky, jumping finite automata, general jumping finite automata, membership problem, integer linear programming, constraint integer programming, backtrack, heuristics, Text

URL: http://hdl.handle.net/11012/69461