Relevant bibliographies by topics / Gurobi

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Gurobi'

Author: Grafiati
Published: 4 June 2021
Last updated: 8 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Gurobi.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Gurobi"

1

Xiao, Liyang, Mahjoub Dridi, Amir Hajjam El Hassani, Wanlong Lin, and Hongying Fei. "A solution method for treatment scheduling in rehabilitation hospitals with real-life requirements." IMA Journal of Management Mathematics 30, no. 4 (July 3, 2018): 367–86. http://dx.doi.org/10.1093/imaman/dpy009.

Full text
Abstract:
Abstract In this study, we aim to minimize the total waiting time between successive treatments for inpatients in rehabilitation hospitals (departments) during a working day. Firstly, the daily treatment scheduling problem is formulated as a mixed-integer linear programming model, taking into consideration real-life requirements, and is solved by Gurobi, a commercial solver. Then, an improved cuckoo search algorithm is developed to obtain good quality solutions quickly for large-sized problems. Our methods are demonstrated with data collected from a medium-sized rehabilitation hospital in China. The numerical results indicate that the improved cuckoo search algorithm outperforms the real schedules applied in the targeted hospital with regard to the total waiting time of inpatients. Gurobi can construct schedules without waits for all the tested dataset though its efficiency is quite low. Three sets of numerical experiments are executed to compare the improved cuckoo search algorithm with Gurobi in terms of solution quality, effectiveness and capability to solve large instances.
APA, Harvard, Vancouver, ISO, and other styles
2

LEWIS, MARK, and GARY KOCHENBERGER. "GRAPH BISECTION MODELED AS CARDINALITY CONSTRAINED BINARY QUADRATIC TASK ALLOCATION." International Journal of Information Technology & Decision Making 12, no. 02 (March 2013): 261–76. http://dx.doi.org/10.1142/s0219622013500119.

Full text
Abstract:
In this paper, the cardinality constrained quadratic model for binary quadratic programming is used to model and solve the graph bisection problem as well as its generalization in the form of the task allocation problem with two processors (2-TAP). Balanced graph bisection is an NP-complete problem which partitions a set of nodes in the graph G = (N, E) into two sets with equal cardinality such that a minimal sum of edge weights exists between the nodes in the two separate sets. 2-TAP is graph bisection with the addition of node preference costs in the objective function. We transform the general linear k-TAP model to the cardinality constrained quadratic binary model so that it may be efficiently solved using tabu search with strategic oscillation. On a set of benchmark graph bisections, we improve the best known solution for several problems. Comparison results with the state-of-the-art graph partitioning program METIS, as well as Cplex and Gurobi are presented on a set of randomly generated graphs. This approach is shown to also work well with 2-TAP, comparing favorably to Cplex and Gurobi, providing better solutions in a much shorter time.
APA, Harvard, Vancouver, ISO, and other styles
3

Liu, Qiang, Jia Wu, Xiantao Xiao, and Liwei Zhang. "A note on distributionally robust optimization under moment uncertainty." Journal of Numerical Mathematics 26, no. 3 (September 25, 2018): 141–50. http://dx.doi.org/10.1515/jnma-2017-0020.

Full text
Abstract:
AbstractWe considers a distributionally robust optimization problem when the ambiguity set specifies the support as well as the mean and the covariance matrix of the uncertain parameters. After deriving a general deterministic reformulation for the distributionally robust optimization problem, we obtain tractable optimization reformulations when the support set is the whole space and when it is a convex polyhedral set. A hybrid method of Gurobi and a smoothing Newton conjugate gradient method is suggested to solve the tractable optimization problems and numerical results of the hybrid method for solving an illustrative example are reported.
APA, Harvard, Vancouver, ISO, and other styles
4

Du, Bo, and Hong Zhou. "A Robust Optimization Approach to the Multiple Allocation p-Center Facility Location Problem." Symmetry 10, no. 11 (November 2, 2018): 588. http://dx.doi.org/10.3390/sym10110588.

Full text
Abstract:
In this study, we apply a robust optimization approach to a p-center facility location problem under uncertainty. Based on a symmetric interval and a multiple allocation strategy, we use three types of uncertainty sets to formulate the robust problem: box uncertainty, ellipsoidal uncertainty, and cardinality-constrained uncertainty. The equivalent robust counterpart models can be solved to optimality using Gurobi. Comprehensive numerical experiments have been conducted by comparing the performance of the different robust models, which illustrate the pattern of robust solutions, and allocating a demand node to multiple facilities can reduce the price of robustness, and reveal that alternative models of uncertainty can provide robust solutions with different conservativeness.
APA, Harvard, Vancouver, ISO, and other styles
5

Triantafyllidis, Charalampos P., and Nikolaos Samaras. "A new non-monotonic infeasible simplex-type algorithm for Linear Programming." PeerJ Computer Science 6 (March 30, 2020): e265. http://dx.doi.org/10.7717/peerj-cs.265.

Full text
Abstract:
This paper presents a new simplex-type algorithm for Linear Programming with the following two main characteristics: (i) the algorithm computes basic solutions which are neither primal or dual feasible, nor monotonically improving and (ii) the sequence of these basic solutions is connected with a sequence of monotonically improving interior points to construct a feasible direction at each iteration. We compare the proposed algorithm with the state-of-the-art commercial CPLEX and Gurobi Primal-Simplex optimizers on a collection of 93 well known benchmarks. The results are promising, showing that the new algorithm competes versus the state-of-the-art solvers in the total number of iterations required to converge.
APA, Harvard, Vancouver, ISO, and other styles
6

González, Martín, Jose J. López-Espín, and Juan Aparicio. "A Parallel Algorithm for Matheuristics: A Comparison of Optimization Solvers." Electronics 9, no. 9 (September 21, 2020): 1541. http://dx.doi.org/10.3390/electronics9091541.

Full text
Abstract:
Metaheuristic and exact methods are one of the most common tools to solve Mixed-Integer Optimization Problems (MIPs). Most of these problems are NP-hard problems, being intractable to obtain optimal solutions in a reasonable time when the size of the problem is huge. In this paper, a hybrid parallel optimization algorithm for matheuristics is studied. In this algorithm, exact and metaheuristic methods work together to solve a Mixed Integer Linear Programming (MILP) problem which is divided into two different subproblems, one of which is linear (and easier to solve by exact methods) and the other discrete (and is solved using metaheuristic methods). Even so, solving this problem has a high computational cost. The algorithm proposed follows an efficient decomposition which is based on the nature of the decision variables (continuous versus discrete). Because of the high cost of the algorithm, as this kind of problem belongs to NP-hard problems, parallelism techniques have been incorporated at different levels to reduce the computing cost. The matheuristic has been optimized both at the level of the problem division and internally. This configuration offers the opportunity to improve the computational time and the fitness function. The paper also focuses on the performance of different optimization software packages working in parallel. In particular, a comparison of two well-known optimization software packages (CPLEX and GUROBI) is performed when they work executing several simultaneous instances, solving various problems at the same time. Thus, this paper proposes and studies a two-level parallel algorithm based on message-passing (MPI) and shared memory (Open MP) schemes where the two subproblems are considered and where the linear problem is solved by using and studying optimization software packages (CPLEX and GUROBI). Experiments have also been carried out to ascertain the performance of the application using different programming paradigms (shared memory and distributed memory).
APA, Harvard, Vancouver, ISO, and other styles
7

Jablonský, Josef. "Benchmarks for Current Linear and Mixed Integer Optimization Solvers." Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis 63, no. 6 (2015): 1923–28. http://dx.doi.org/10.11118/actaun201563061923.

Full text
Abstract:
Linear programming (LP) and mixed integer linear programming (MILP) problems belong among very important class of problems that find their applications in various managerial consequences. The aim of the paper is to discuss computational performance of current optimization packages for solving large scale LP and MILP optimization problems. Current market with LP and MILP solvers is quite extensive. Probably among the most powerful solvers GUROBI 6.0, IBM ILOG CPLEX 12.6.1, and XPRESS Optimizer 27.01 belong. Their attractiveness for academic research is given, except their computational performance, by their free availability for academic purposes. The solvers are tested on the set of selected problems from MIPLIB 2010 library that contains 361 test instances of different hardness (easy, hard, and not solved).
APA, Harvard, Vancouver, ISO, and other styles
8

Stetsyuk, P., O. Lykhovyd, and A. Suprun. "On Linear and Quadratic Two-Stage Transportation Problem." Cybernetics and Computer Technologies, no. 4 (December 31, 2020): 5–14. http://dx.doi.org/10.34229/2707-451x.20.4.1.

Full text
Abstract:
Introduction. When formulating the classical two-stage transportation problem, it is assumed that the product is transported from suppliers to consumers through intermediate points. Intermediary firms and various kinds of storage facilities (warehouses) can act as intermediate points. The article discusses two mathematical models for two-stage transportation problem (linear programming problem and quadratic programming problem) and a fairly universal way to solve them using modern software. It uses the description of the problem in the modeling language AMPL (A Mathematical Programming Language) and depends on which of the known programs is chosen to solve the problem of linear or quadratic programming. The purpose of the article is to propose the use of AMPL code for solving a linear programming two-stage transportation problem using modern software for linear programming problems, to formulate a mathematical model of a quadratic programming two-stage transportation problem and to investigate its properties. Results. The properties of two variants of a two-stage transportation problem are described: a linear programming problem and a quadratic programming problem. An AMPL code for solving a linear programming two-stage transportation problem using modern software for linear programming problems is given. The results of the calculation using Gurobi program for a linear programming two-stage transportation problem, which has many solutions, are presented and analyzed. A quadratic programming two-stage transportation problem was formulated and conditions were found under which it has unique solution. Conclusions. The developed AMPL-code for a linear programming two-stage transportation problem and its modification for a quadratic programming two-stage transportation problem can be used to solve various logistics transportation problems using modern software for solving mathematical programming problems. The developed AMPL code can be easily adapted to take into account the lower and upper bounds for the quantity of products transported from suppliers to intermediate points and from intermediate points to consumers. Keywords: transportation problem, linear programming problem, AMPL modeling language, Gurobi program, quadratic programming problem.
APA, Harvard, Vancouver, ISO, and other styles
9

Zhong, Lingshu, and Mingyang Pei. "Optimal Design for a Shared Swap Charging System Considering the Electric Vehicle Battery Charging Rate." Energies 13, no. 5 (March 6, 2020): 1213. http://dx.doi.org/10.3390/en13051213.

Full text
Abstract:
Swap charging (SC) technology offers the possibility of swapping the batteries of electric vehicles (EVs), providing a perfect solution for achieving a long-distance freeway trip. Based on SC technology, a shared SC system (SSCS) concept is proposed to overcome the difficulties in optimal swap battery strategies for a large number of EVs with charging requests and to consider the variance in the battery charging rate simultaneously. To realize the optimal SSCS design, a binary integer programming model is developed to balance the tradeoff between the detour travel cost and the total battery recharge cost in the SSCS. The proposed method is verified with a numerical example of the freeway system in Guangdong Province, China, and can obtain an exact solution using off-the-shelf commercial solvers (e.g., Gurobi).
APA, Harvard, Vancouver, ISO, and other styles
10

Correa Issi, Gustavo, Rodrigo Linfati, and John Willmer Escobar. "Mathematical Optimization Model for Truck Scheduling in a Distribution Center with a Mixed Service-Mode Dock Area." Journal of Advanced Transportation 2020 (November 27, 2020): 1–13. http://dx.doi.org/10.1155/2020/8813372.

Full text
Abstract:
Cross-docking is a logistics strategy in which products arriving at a distribution center are unloaded from inbound trucks and sorted for transfer directly to outbound trucks, reducing costs and storage and product handling times. This paper addresses a cross-docking problem by designing a mixed-integer linear programming (MILP) model to determine a schedule for inbound and outbound trucks in a mixed service-mode dock area that minimizes the time from when the first inbound truck arrives until the last outbound truck departs (makespan). The model is developed using AMPL software with the CPLEX and Gurobi solvers, which provide results for different instances, most of these with actual shift data from an integrated distribution center of a multinational food company located in Concepción, Chile. The results obtained from the case study are notable and show the effectiveness of the proposed mathematical model.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Gurobi"

1

Geng, Qifeng. "Time-efficient Computation with Near-optimal Solutions for Maximum Link Activation in Wireless Communication Systems." Thesis, Linköpings universitet, Kommunikations- och transportsystem, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-74571.

Full text
Abstract:
In a generic wireless network where the activation of a transmission link is subject to its signal-to-noise-and-interference ratio (SINR) constraint, one of the most fundamental and yet challenging problem is to find the maximum number of simultaneous transmissions. In this thesis, we consider and study in detail the problem of maximum link activation in wireless networks based on the SINR model. Integer Linear Programming has been used as the main tool in this thesis for the design of algorithms. Fast algorithms have been proposed for the delivery of near-optimal results time-efficiently. With the state-of-art Gurobi optimization solver, both the conventional approach consisting of all the SINR constraints explicitly and the exact algorithm developed recently using cutting planes have been implemented in the thesis. Based on those implementations, new solution algorithms have been proposed for the fast delivery of solutions. Instead of considering interference from all other links, an interference range has been proposed. Two scenarios have been considered, namely the optimistic case and the pessimistic case. The optimistic case considers no interference from outside the interference range, while the pessimistic case considers the interference from outside the range as a common large value. Together with the algorithms, further enhancement procedures on the data analysis have also been proposed to facilitate the computation in the solver.
APA, Harvard, Vancouver, ISO, and other styles
2

Antoniu, Silvia Ana Maria. "Modelli di supporto decisionale per la pianificazione di reti produttive nell’industria del Catering: Il caso Camst." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021.

Find full text
Abstract:
Il seguente lavoro di tesi è frutto di un progetto di collaborazione tra il Dipartimento di Ingegneria Industriale dell’Università di Bologna e Camst Soc. Coop. a r.l. In questo studio ci si è posti l’obiettivo di sviluppare, modellare e validare uno strumento di supporto decisionale per la progettazione e pianificazione strategica della rete distributiva. In particolare, è stata sviluppata una gerarchia di modelli di ottimizzazione che possa orientare le aziende dell’industria del Catering nella localizzazione e definizione delle capacità produttive delle cucine centralizzate. Inizialmente si è sviluppato un modello generalizzato, che lavora su scala nazionale, il quale in un’ottica di multi obiettivo supporta nella decisione di quanti e quali “attori” aprire, quali capacità produttive allocare e quale domanda soddisfare, minimizzando il costo totale di apertura e trasporto del network e garantendo allo stesso tempo una riduzione degli impatti ambientali. Inoltre, viene integrato un approccio di ottimizzazione stocastica per aumentare la probabilità che la rete possa soddisfare le variazioni della domanda dei pasti. Successivamente, si è sviluppato un modello tattico che affronti lo stesso problema di ottimizzazione non più su scala nazionale ma a un livello decisionale inferiore. Il modello è stato pensato per la realtà aziendale Camst Soc. Coop. a r.l., con focus sulla regione Friuli Venezia Giulia, e può operare a valle dell’ottimizzazione fatta a livello nazionale: per esempio, prende a riferimento le cucine e le capacità che il modello di prima ha aperto e alloccato, associando a queste un routing di consegna. Infatti si è voluto integrare nel modello un problema di routing introducendo opportuni vincoli di copertura, in quanto si lavora su scala molto più piccola e la numerosità delle variabili decisionali binarie è tale da non aumentare la complessità del modello, rendendolo risolvibile mediante il software AMPL e il risolutore Gurobi.
APA, Harvard, Vancouver, ISO, and other styles
3

Žítek, Jan. "Využití vícekriteriálního lineárního programování pro přípravu rozvrhu střední školy." Master's thesis, Vysoká škola ekonomická v Praze, 2016. http://www.nusl.cz/ntk/nusl-264666.

Full text
Abstract:
The theme of this thesis is high school timetabling. The built mathematical model is based on bivalent programming. The model uses multicriteria linear programming too, because a timetable has to fill legal and school's requests and student's and teacher's wishes. Firstly, there are given theoretical basics. Then there is described economic model with school's characteristics and it continues by mathematical model. For optimization, tool MPL for Windows with using Gurobi. Finally, export of optimization is transferred using VBA to form for end users.
APA, Harvard, Vancouver, ISO, and other styles
4

Madhvarayan, Vishnu. "Integrated Production and Distribution Planning for a Food Processing Company." University of Cincinnati / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1459155559.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Toffali, Davide. "Modello di ottimizzazione distribuito per l’esercizio delle risorse di generazione e accumulo in una comunità energetica rinnovabile." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021.

Find full text
Abstract:
Lo sviluppo della rete rappresenta uno dei principali fattori abilitanti del processo, complesso e sfidante, di transizione verso il sistema energetico futuro. Esso rappresenta una parte molto importante del sistema elettrico nazionale e l’ammontare delle perdite ad esso legate non è trascurabile. Una possibile soluzione consiste nel ridurre le dispersioni, che gravano su tale sistema, cercando di consumare in loco l’energia prodotta da generatori alimentati da fonti rinnovabili, la cui presenza è molto distribuita sul territorio nazionale. Negli ultimi anni si assiste allo sviluppo della nuova realtà delle comunità energetiche rinnovabili, nelle quali un numero di utenti si organizza a livello comunitario per consumare l’energia autoprodotta, ricorrendo alla rete di distribuzione solo in caso di produzione in eccesso o insufficiente. Questa tesi è dedicata allo sviluppo e all’implementazione di un modello di tipo distribuito per l’ottimizzazione delle risorse all’interno di una comunità energetica rinnovabile, ponendo come scopo finale la minimizzazione delle perdite di potenza. Si compone di cinque capitoli. Il primo espone l’intera realtà delle comunità energetiche rinnovabili, partendo dalla descrizione di generazione distribuita e autoconsumo fino ad analizzare le tecnologie attuali e i regolamenti. Nel secondo capitolo viene definito e formulato il problema del Power Flow. Successivamente è descritto il modello di rete utilizzato per il progetto di tesi e introdotto il problema da ottimizzare per ridurre le perdite. Il terzo e quarto capitolo rappresentano dettagliatamente i modelli utilizzati, rispettivamente per il calcolo di tipo centralizzato e per il calcolo distribuito, e la loro implementazione nel software MATLAB. Per il secondo si è prima presentato l’algoritmo “Alternating Direction Multiplier Method”. Nell’ultimo capitolo si esaminano e si confrontano i risultati ottenuti dalle simulazioni dei modelli precedentemente esposti.
APA, Harvard, Vancouver, ISO, and other styles
6

Skočdopolová, Veronika. "Modely cílového programování: teorie, aplikace, softwarová podpora." Doctoral thesis, Vysoká škola ekonomická v Praze, 2014. http://www.nusl.cz/ntk/nusl-201133.

Full text
Abstract:
Goal programming is an approach for solving decision problems. The aim of this doctoral thesis is to show the practical use of this approach for solving real problems. The first chapter brings a brief introduction to multicriteria decision making. The second chapter is devoted to goal programming, its history, theory, criticism and also to its practical applications. The third chapter deals with description of a model for optimisation of white mass production. This model utilises the goal programming principle to deal with measuring deviations of raw materials' composition. A part of this chapter is a presentation of OPTIPROT, an application that implements the mentioned model. In the fourth chapter there are described three mathematical models for timetabling at a department level; two multistage models and one complex model. All three models are formulated utilising goal programming. In this chapter there is also described an application that implements the complex model for timetabling.
APA, Harvard, Vancouver, ISO, and other styles
7

Elianti, Luca. "Implementazione e test di modelli di ottimizzazione per la pianificazione tattica del blocco operatorio." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2016.

Find full text
Abstract:
In questa tesi è stato analizzato e tradotto nel linguaggio di alto livello AMPL un modello di ILP relativo alla pianificazione tattica del blocco operatorio. L'obiettivo è quello di permettere l'interfacciamento con numerosi solver -commerciali e non- al fine di analizzarne le prestazioni. In seguito a un'introduzione in merito al problema dell'Operating Room Management e a una descrizione del contesto sanitario regionale dell'Emilia-Romagna, si è proceduto alla descrizione formale del modello. Infine sono state eseguite numerose risoluzioni con i solver cplex e gurobi al variare di alcuni parametri in ingresso, tra cui il numero di sale operatorie, di infermieri e operatori sanitari, e di pazienti in lista d'attesa.
APA, Harvard, Vancouver, ISO, and other styles
8

Ptáčková, Michaela. "Optimalizace tras při rozvozu zásilek." Master's thesis, Vysoká škola ekonomická v Praze, 2014. http://www.nusl.cz/ntk/nusl-264544.

Full text
Abstract:
This thesis deals with optimization problems of the parcels distribution. This issue can be solved on the ground of traveling salesman problem whose mathematical and economic model, including their modifications, are presented in the theoretical part of the thesis. We can solve these problems by using exact methods, heuristic and metaheuristic algorithms. In the theoretical part are described traveling salesman problem, traveling salesman problem with time windows, traveling salesman problem with multiple time windows and dynamic traveling salesman problem including possible ways of solution. In the practical part we can find application of problems on the real example, when we are finding the shortest possible route for the PPL's employee under different assumptions. The solution is obtained by using solver Gurobi within the modelling system MPL for Windows. In conclusion of the thesis the results are summarized and models are compared with each other.
APA, Harvard, Vancouver, ISO, and other styles
9

Omiccioli, Andrea. "Sviluppo di modelli e metodi di ottimizzazione per il dock assignment in un magazzino cross-docking: Il caso OneExpress Italia S.p.A." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2019.

Find full text
Abstract:
Il seguente elaborato evidenzia il processo utilizzato per arrivare allo sviluppo di uno strumento che favorisca il processo decisionale all’interno dell’azienda One Express. Riporta le attività preliminari realizzate per arrivare ad una comprensione chiara e univoca del processo, in particolare: mappatura BPMN, realizzazione del layout aziendale e analisi “tempi e metodi”. Dall’analisi sono emerse le principali criticità che sono state classificate sia in termini strategici come la mancanza di un sistema a supporto per la scelta della buca di scarico ottimale, sia in termini operativi come la saturazione dei polmoni e il disaccoppiamento dell’attività di carico e scarico. Tutto questo ha portato allo sviluppo di 2 strumenti: un simulatore e costificatore per l’analisi del tempo ciclo del processo e determinazione del numero di operatori e dei modelli di dock assignment per la definizione della buca di scarico ottimale. Dai modelli realizzati si è andata ad evidenziare la diversa configurazione che essi generavano rispetto alla situazione AS-IS. Per il modello [7] il più completo tra quelli sviluppati, che consente la valutazione della buca di scarico da assegnare considerando la possibilità di scaricare in due hub, la scelta tra navettaggio e doppio scarico e della buca di scarico della navetta, è stata sviluppata un’analisi su un orizzonte temporale di 4 ore per verificare con maggior precisione la bontà del modello. I risultati ottenuti hanno dimostrato come il carico di lavoro richiesto per le attività di smistamento può essere ridotto significativamente. I modelli per come sono stati pensati e sviluppati potrebbero avere sia una applicazione strategica atta a programmare anticipatamente le buche di scarico dei mezzi sia una operativa, in caso di disallineamento tra la situazione reale e quella attesa. Questo permetterebbe di riuscire a migliorare la schedulazione dei mezzi in arrivo e il bilanciamento delle attività all’interno del magazzino.
APA, Harvard, Vancouver, ISO, and other styles
10

Mendes, Maria Elaine. "Ensino de inglês em Gurupi/TO sujeitos, crenças e trajetórias." Universidade Federal do Tocantins, 2014. http://hdl.handle.net/11612/183.

Full text
Abstract:
Na contemporaneidade, parece haver uma tentativa de compreender como ocorrem as mudanças individuais e coletivas na sociedade. Em tal compreensão, o conceito de identidade tem permeado campos distintos do saber, sobretudo a educação (suas disciplinas afins como a linguística e a história). O estudo aqui descrito converge para esse conceito, pois o texto materializa uma pesquisa que objetivou compreender as crenças presentes no cotidiano de professores de inglês de Gurupi (TO) e as implicações que têm tanto na construção da identidade deles quanto na imagem que têm de si como professores de língua estrangeira. Para cumprir esse objetivo, a pesquisa recorreu a uma leitura analíticointerpretativa de relatos orais desses professores e de pais de alunos. A pesquisa enfoca o contexto de formação docente do sul de Tocantins; e o faz mediante a abordagem da história de vida, que se vale da metodologia da história oral. Através de um levantamento de natureza qualitativa, foram realizadas entrevistas semiestruturadas com professores de escolas públicas e de cursos de inglês, além de questionários enviados aos pais de alunos. Os resultados evidenciam uma relação bem próxima entre crenças e experiência de ensino e aprendizagem e certo desprestígio e desânimo que se vinculam não só à prática, mas também às representações sociais do professor de inglês. Sua identidade se erige na associação entre um desejo idealizado de falar inglês e a falta de meios para tal. Como memória de modelos adquiridos na prática escolar discente e docente, as vivências relatadas suscitaram reflexões particulares do fazer profissional, isto é, de experiências pessoais não só no ensino de Língua Inglesa, mas também na aprendizagem.
In the contemporary world, there seems to be an attempt to understand how both individual and group changes occur in society. In such understanding, the concept of identity permeates different fields of knowledge, especially education in its relationship with linguistics, history, and culture. This study converges to this relationship in presenting results of a research aimed at understanding everyday life beliefs of English language teachers from Gurupi, state of Tocantins, and how these beliefs affect the formation of their identity and the way they see themselves as teachers of English language. This research has focused on teacher‘s education and training context. Fulfilling its aim meant to rely on an interpretive analysis of oral accounts given by teachers and pupils‘ parents. A life-story approach was used in connection with oral history as research methodology. A qualitative survey was carried out with semi-structured interview and questionnaire as tools to gather data from English language teachers who work at public schools and at English private schools; in addition, from parents who enroll their children in private language schools. Results point out a close relationship between learning and teaching beliefs among teachers and parents as well as a certain discredit and discouragement towards not only their profession but also representations of the English language teacher. His/her identity builds upon the association of an idealised crave to speak English and a lack of means to do so. As memories of social model acquired in school as student and as teacher, their accounts has awaken personal thoughts on the teacher‘s professional making, which means personal experiences related not only to teaching English but also to learning it.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Gurobi"

1

Makharadze, Irakli. Guruli pʻiralebi. Tʻbilisi: Bakur Sulakauris gamomcʻemloba, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Arístegui, Pablo Bilbao. Jesús Guridi. [Alava]: Diputación Foral de Alava, Departamento de Cultura, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Alekseĭ, Makeev, ed. Prevoskhodstvo Gurova. Moskva: ĖKSMO, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Alekseĭ, Makeev, ed. Ulʹtimatum Gurova. Moskva: ĖKSMO, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Guruli pʻiralebi. Tʻbilisi: Bakur Sulakauris gamomcʻemloba, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Wanda Gág. Mīlīyunhā gurbih. 3rd ed. Tihrān: Intishārāt-i Illmī Farhangī, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Guruli pʻiralebi. 2nd ed. Tʻbilisi: Amomcʻemloba [sic] "Kaligrapʻi", 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Andrés, Víctor Pliego de. Jesús Guridi. Madrid: SGAE, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Prabhakar, Pradhan Ganesh. Sane Guruji. New Delhi: Sahitya Akademi, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kamura, Kunio. Gurabā-en monogatari. Nagasaki-shi: Nagasaki Bunkensha, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Gurobi"

1

Helm, Werner E., and Jan-Erik Justkowiak. "Extension of Mittelmann’s Benchmarks: Comparing the Solvers of SAS and Gurobi." In Operations Research Proceedings 2016, 607–13. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-55702-1_80.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Meier, Danny, Benjamin Keller, Markus Kolb, and Thomas Hanne. "Solving Inventory Routing Problems with the Gurobi Branch-and-Cut Algorithm." In Communications in Computer and Information Science, 173–89. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-85672-4_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Muley, Vijaykumar Yogesh. "Mathematical Linear Programming to Model MicroRNAs-Mediated Gene Regulation Using Gurobi Optimizer." In Modeling Transcriptional Regulation, 287–301. New York, NY: Springer US, 2021. http://dx.doi.org/10.1007/978-1-0716-1534-8_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Muley, Vijaykumar Yogesh. "Mathematical Programming for Modeling Expression of a Gene Using Gurobi Optimizer to Identify Its Transcriptional Regulators." In Modeling Transcriptional Regulation, 99–113. New York, NY: Springer US, 2021. http://dx.doi.org/10.1007/978-1-0716-1534-8_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Börchers, Sabine. "Rodoreda i Gurgui, Mercè." In Metzler Autorinnen Lexikon, 457–58. Stuttgart: J.B. Metzler, 1998. http://dx.doi.org/10.1007/978-3-476-03702-2_318.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Müller, Monika. "Interview mit Guruji Mohan und Dr. Abhimanyu Sharma." In Spiritualität als (ein) Weg der Welterfassung, 5–7. Göttingen: Vandenhoeck & Ruprecht, 2016. http://dx.doi.org/10.13109/9783666806131.5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Spiller, Roland. "Mendoza, Eduardo: Sin noticias de Gurb." In Kindlers Literatur Lexikon (KLL), 1–2. Stuttgart: J.B. Metzler, 2020. http://dx.doi.org/10.1007/978-3-476-05728-0_13158-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Norconk, Marilyn A., and Brian W. Grafton. "Changes in Forest Composition and Potential Feeding Tree Availability on a Small Land-Bridge Island in Lago Guri, Venezuela." In Primates in Fragments, 211–27. Boston, MA: Springer US, 2003. http://dx.doi.org/10.1007/978-1-4757-3770-7_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Norconk, Marilyn A. "Seasonal Variation in the Diets of White-Faced and Bearded Sakis (Pithecia pithecia and Chiropotes satanas) in Guri Lake, Venezuela." In Adaptive Radiations of Neotropical Primates, 403–23. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-1-4419-8770-9_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Galichon, Alfred. "The Discrete Optimal Assignment Problem." In Optimal Transport Methods in Economics. Princeton University Press, 2016. http://dx.doi.org/10.23943/princeton/9780691172767.003.0003.

Full text
Abstract:
This chapter considers the finite-dimensional case, which is the case when the marginal probability distributions are discrete with finite support. In this case, the Monge–Kantorovich problem becomes a finite-dimensional linear programming problem; the primal and the dual solutions are related by complementary slackness, which is interpreted in terms of stability. The solutions can be conveniently computed by linear programming solvers, and the chapter shows how this is done using some matrix algebra and Gurobi.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Gurobi"

1

Dos Santos, Jorge, Guilherme Londe, Alexandre Ribeiro, and Welverton Da Silva. "Formulações e heurı́sticas para os problemas leasing k-median e leasing k-center." In IV Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/etc.2019.6397.

Full text
Abstract:
Neste artigo, consideramos as generalizações dos problemas k-median e k-center, conhecidas, respectivamente, por leasing k-median (LKM) e leasing k-center (LKC). Apresentamos formulações de programação linear inteira e uma heurı́stica baseada na meta-heurı́stica BRKGA. Comparamos as soluções geradas pela heurı́stica com as soluções geradas pelo resolvedor GUROBI aplicado às formulações em programação linear, estabelecendo um prazo de 10 minutos de execução para ambos. Para as instâncias pequenas testadas, os custos das soluções heurı́sticas foram próximos aos custos ótimos (GAP médio ≤ 8%). Para instâncias maiores testadas a heurı́stica gerou soluções superiores às do resolvedor, em pelo menos metade dos testes.
APA, Harvard, Vancouver, ISO, and other styles
2

Berndsen Peccin, Vinícius, Daniel Martins Lima, Rodolfo César Costa Flesch, and Julio Elias Normey-Rico. "Algoritmos GPC de Cômputo Rápido com Métodos de Ponto Interior e Programação Quadrática Sem Projeção." In Congresso Brasileiro de Automática - 2020. sbabra, 2020. http://dx.doi.org/10.48011/asba.v2i1.1652.

Full text
Abstract:
Historicamente, o controle preditivo generalizado (GPC) vem sendo mais utilizado em plantas com dinâmicas lentas, devido ao alto custo computacional requerido para o cômputo da ação de controle. Mais recentemente, soluções de cômputo rápido do sinal de controle do GPC vêm sendo apresentadas. Nesse sentido, o presente trabalho visa contribuir com a proposta de dois algoritmos baseados no método de ponto interior (IP) e no método de programação quadrática paralela (PFQP). É também apresentado um estudo comparativo com dois algoritmos de GPC da literatura que utilizam os métodos GPAD e ADMM. Para servir de referência, foi utilizado o otimizador comercial Gurobi. A partir do estudo comparativo, pôde-se verificar um melhor desempenho do algoritmo GPAD e a sensibilidade dos algoritmos ADMM e PFQP em cenários com tolerâncias menores e diferentes tipos de restrição. Ressaltou-se também que, apesar de mais lento, o algoritmo com IP apresentou baixa variação no tempo de cômputo com os cenários propostos.
APA, Harvard, Vancouver, ISO, and other styles
3

Sagar, Keerthi, Dimiter Zlatanov, Matteo Zoppi, Cristiano Nattero, and Sreekumar Muthuswamy. "Multi-Goal Path Planning for Robotic Agents With Discrete-Step Locomotion." In ASME 2017 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/detc2017-68011.

Full text
Abstract:
The paper introduces a new, intrinsically discrete, path planning and collision-avoidance problem, with multiple robots and multiple goals. The issue arises in the operation of the novel Swing and Dock (SaD) locomotion for a material handling system. Its agents traverse a base grid by sequences of rotations (swings) around fixed pins. Each agent must visit an array of goal positions in minimal time while avoiding collisions. The corresponding off-line path-planning problem is NP-hard. We model the system by an extended temporal graph and introduce two integer linear programming (ILP) formulations for the minimization of the makespan, with decision variables on the nodes and the edges, respectively. Both optimizations are constrained and favor idling over detours to reduce mechanical wear. The ILP formulations, tailored to the SaD system, are general enough to be applicable for many other single- and multi-agent problems over discretized networks. We have implemented the ILPs with a gurobi solver. Computational results demonstrate and compare the effectiveness of the two formulations.
APA, Harvard, Vancouver, ISO, and other styles
4

Sagar, Keerthi, Dimiter Zlatanov, Matteo Zoppi, Cristiano Nattero, and Sreekumar Muthuswamy. "Orientation Planning for Multi-Agents With Discrete-Step Locomotion and Multiple Goals." In ASME 2018 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/detc2018-86147.

Full text
Abstract:
The paper addresses the coordinated path planning of mobile agents with multiple goal positions and orientations in a plane. The targeted multi-robot system uses discrete locomotion ensuring uncertainty-free localization and mapping as well as simple and robust control. It is suitable for material-handling, reconfigurable-fixturing, and mobile-manipulation tasks in a flexible-manufacturing environment. Using its three leg, and matching pin-socket couplings with the base surface, each agent either stands fixed or strides along via “Swing and Dock” (SaD) locomotion. Each mounting pin can serve both as a connecting-locking device and as a pivot of a planar rotation. Previous work offered planning solutions only for the agents’ positions. In reality, the orientation in which the agent arrives at the goal is very important because neither robot workspaces nor workcell geometries have axial symmetry. Herein, we provide for the required orientational planning by labelling the agent’s legs to keep track of its rotation. Integer Linear Programming (ILP) is used to model the path planning problem in the so augmented configuration space. The mathematical formulations are implemented and tested using a GUROBI solver. Computational results display the effectiveness of the approach.
APA, Harvard, Vancouver, ISO, and other styles
5

SOUZA, MARCOS JOSÉ MARQUES PINHO, Kadyan de Paula Gonzaga e. Castro, Luis Claudio Barbosa, IGHOR FERNANDO DE MENESES RODRIGUES, and Matheus Mendes Fernandes. "CRIME CIBERNÉTICO PREJUDICIAL À SAÚDE, À LUZ DO PROJETO DE LEI N°. 847/2019." In V Semana Integrada de Ciência e Tecnologia de Gurupi: SITEG. Recife, Brasil: Even3, 2019. http://dx.doi.org/10.29327/117627.1-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Melo, Mylena Galdino de, and Rafaela de Carvalho Alves. "COMPARAÇÃO DAS TÉCNICAS DE ACUPUNTURA E VENTOSATERAPIA NA DOR E QUALIDADE DE VIDA DE FIBROMIÁLGICAS." In V Semana Integrada de Ciência e Tecnologia de Gurupi: SITEG. Recife, Brasil: Even3, 2019. http://dx.doi.org/10.29327/117627.1-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Cavalcante, Thomas, and Daniel Ferreira Falcão. "O DESAFIO DA IMPLANTAÇÃO DE UM EMPREENDIMENTO DENTRO DO PMCMV, FAIXA 1, EM GURUPI-TO." In 14ª Conferência Internacional da LARES. Latin American Real Estate Society, 2014. http://dx.doi.org/10.15396/lares_2014_929-1187-1-rv.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Morais, Leivia Lima de, Eliara Firmina Maria Silva Alves, Valmir Fernandes de Lira, LUCAS FRANCA MARRA, and Rafaela de Carvalho Alves. "CINESIOTERAPIA LABORAL APLICADA ÀS AGENTES COMUNITÁRIAS DE SAÚDE DA UBS SEVILHA DE GURUPI-TO: RELATO DE EXPERIÊNCIA." In Anais do Sicteg-ON. Recife, Brasil: Even3, 2021. http://dx.doi.org/10.29327/130639.6-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Souza, Sueny Diana Oliveira de. "Quilombolas do Gurupi: as organizações político-sociais das comunidades remanescentes quilombolas de Paca e Aningal – PA (2004-2007)." In IV Congresso Internacional de História. Programa de Pós-Graduação em História e Departamento de História - Universidade Estadual de Maringá - UEM, 2009. http://dx.doi.org/10.4025/4cih.pphuem.590.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Naufalin, Rifda, Rumpoko Wicaksono, and Eva Triyulianingrum. "Edible coating application with addition of kecombrang flower concentrates to maintain quality fillets of gurami fish during storage." In 1ST INTERNATIONAL CONFERENCE ON MATERIAL SCIENCE AND ENGINEERING FOR SUSTAINABLE RURAL DEVELOPMENT. Author(s), 2019. http://dx.doi.org/10.1063/1.5097500.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Gurobi"

1

Potentiometric surface of the alluvial aquifer and hydrologic conditions near Gurabo and Juncos, Puerto Rico, March 1988. US Geological Survey, 1990. http://dx.doi.org/10.3133/wri904059.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Geologic map of the Guri and southern part of the Tucupita 2 degrees by 3 degrees quadrangles, Bolivar State, Venezuela. US Geological Survey, 1993. http://dx.doi.org/10.3133/mf2242.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Gurobi' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography