Conferences related to Integer linear programming

Back to Top

2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA )

ETFA focus is on the latest developments and new technologies in the field of industrial and factory automation. The conference aims to exchange ideas with both industry leaders and a variety of experienced researchers, developers, and practitioners from several industries, research institutes, and academia


ICC 2021 - IEEE International Conference on Communications

IEEE ICC is one of the two flagship IEEE conferences in the field of communications; Montreal is to host this conference in 2021. Each annual IEEE ICC conference typically attracts approximately 1,500-2,000 attendees, and will present over 1,000 research works over its duration. As well as being an opportunity to share pioneering research ideas and developments, the conference is also an excellent networking and publicity event, giving the opportunity for businesses and clients to link together, and presenting the scope for companies to publicize themselves and their products among the leaders of communications industries from all over the world.


2020 59th IEEE Conference on Decision and Control (CDC)

The CDC is the premier conference dedicated to the advancement of the theory and practice of systems and control. The CDC annually brings together an international community of researchers and practitioners in the field of automatic control to discuss new research results, perspectives on future developments, and innovative applications relevant to decision making, automatic control, and related areas.


2020 IEEE International Conference on Image Processing (ICIP)

The International Conference on Image Processing (ICIP), sponsored by the IEEE SignalProcessing Society, is the premier forum for the presentation of technological advances andresearch results in the fields of theoretical, experimental, and applied image and videoprocessing. ICIP 2020, the 27th in the series that has been held annually since 1994, bringstogether leading engineers and scientists in image and video processing from around the world.


2020 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)

All topics related to engineering and technology management, including applicable analytical methods and economical/social/human issues to be considered in making engineering decisions.


More Conferences

Periodicals related to Integer linear programming

Back to Top

Automatic Control, IEEE Transactions on

The theory, design and application of Control Systems. It shall encompass components, and the integration of these components, as are necessary for the construction of such systems. The word `systems' as used herein shall be interpreted to include physical, biological, organizational and other entities and combinations thereof, which can be represented through a mathematical symbolism. The Field of Interest: shall ...


Automation Science and Engineering, IEEE Transactions on

The IEEE Transactions on Automation Sciences and Engineering (T-ASE) publishes fundamental papers on Automation, emphasizing scientific results that advance efficiency, quality, productivity, and reliability. T-ASE encourages interdisciplinary approaches from computer science, control systems, electrical engineering, mathematics, mechanical engineering, operations research, and other fields. We welcome results relevant to industries such as agriculture, biotechnology, healthcare, home automation, maintenance, manufacturing, pharmaceuticals, retail, ...


Communications Letters, IEEE

Covers topics in the scope of IEEE Transactions on Communications but in the form of very brief publication (maximum of 6column lengths, including all diagrams and tables.)


Communications Surveys & Tutorials, IEEE

Each tutorial reviews currents communications topics in network management and computer and wireless communications. Available tutorials, which are 2.5 to 5 hours in length contains the original visuals and voice-over by the presenter. IEEE Communications Surveys & Tutorials features two distinct types of articles: original articles and reprints. The original articles are exclusively written for IEEE Communications Surveys & Tutorials ...


Communications, IEEE Transactions on

Telephone, telegraphy, facsimile, and point-to-point television, by electromagnetic propagation, including radio; wire; aerial, underground, coaxial, and submarine cables; waveguides, communication satellites, and lasers; in marine, aeronautical, space and fixed station services; repeaters, radio relaying, signal storage, and regeneration; telecommunication error detection and correction; multiplexing and carrier techniques; communication switching systems; data communications; and communication theory. In addition to the above, ...


More Periodicals

Most published Xplore authors for Integer linear programming

Back to Top

Xplore Articles related to Integer linear programming

Back to Top

MINLP algorithms mixed with constraint programming

Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788), 2004

This paper advanced mixed integer nonlinear programming (MINLP) algorithms mixed with constraint programming (CP) to solve industrial process hybrid model mixed with logical rule. CP methods have proved to be successful in solving highly constrained discrete optimization and feasibility problems. It can effectively solve hybrid model mixed with logical rule by integrating CP, nonlinear programming and mixed integer linear programming. ...


Optimal cell flipping in placement and floorplanning

2006 43rd ACM/IEEE Design Automation Conference, 2006

In a placed circuit, there are a lot of movable cells that can be flipped to further reduce the total wirelength, without affecting the original placement solution. We aim at solving this flipping problem optimally. However, solving such a problem optimally is non-trivial given the gigantic sizes of modern circuits. We are able to identify a large portion of cells ...


A method for solving a class of mixed integer linear programming problem with block angular structure

IEEE International Conference on Systems, Man and Cybernetics, 2002

None


Modeling and control of a multi-agent system using mixed integer linear programming

Proceedings of the 41st IEEE Conference on Decision and Control, 2002., 2002

The RoboFlag competition was proposed by the second author as a means to study cooperative control of multi-vehicle systems. Here we study a simplified version of the competition that we model as a hybrid system. We use an optimization approach to synthesize control policies by solving mixed integer linear programs.


A New Method for Solving Bimatrix Games Problems

2010 Third International Conference on Information and Computing, 2010

We present a new method for solving bimatrix games problems. Firstly, bimatrix games problem is transformed into general linear complementarity problem. Then we apply mixed integer linear programming method to linear complementarity problem. At last, we give some numerical examples to indicate that the method is feasible and effective to bimatrix games problems.


More Xplore Articles

Educational Resources on Integer linear programming

Back to Top

IEEE-USA E-Books

  • MINLP algorithms mixed with constraint programming

    This paper advanced mixed integer nonlinear programming (MINLP) algorithms mixed with constraint programming (CP) to solve industrial process hybrid model mixed with logical rule. CP methods have proved to be successful in solving highly constrained discrete optimization and feasibility problems. It can effectively solve hybrid model mixed with logical rule by integrating CP, nonlinear programming and mixed integer linear programming. Computational results demonstrated this algorithm.

  • Optimal cell flipping in placement and floorplanning

    In a placed circuit, there are a lot of movable cells that can be flipped to further reduce the total wirelength, without affecting the original placement solution. We aim at solving this flipping problem optimally. However, solving such a problem optimally is non-trivial given the gigantic sizes of modern circuits. We are able to identify a large portion of cells (about 75%) of which the orientation (flipped or not flipped) can be determined independent of the orientations of all the other cells. We have derived three non-trivial conditions to identify those so called independent cells, strictly solvable cells and conditionally solvable cells. In this way, we can greatly reduce the number of cells whose orientations are dependent on each other. Finally, the cell flipping problem of the remaining dependent cells can be formulated as a mixed integer linear programming (MILP) problem and solved optimally. However, this may still be too slow for extremely large circuits and we have applied two other methods, linear programming (LP) and linear programming followed by mixed integer linear programming (LP+MILP) to solve the problem. Experimental results show that by identifying those independent and solvable cells first and applying the LP+MILP technique, we can solve this flipping problem effectively and obtain results just 0.01% more than the optimal. In addition, we can improve the wirelength and number of overflow tiles by 5% and 9% respectively on the floorplanning benchmarks

  • A method for solving a class of mixed integer linear programming problem with block angular structure

    None

  • Modeling and control of a multi-agent system using mixed integer linear programming

    The RoboFlag competition was proposed by the second author as a means to study cooperative control of multi-vehicle systems. Here we study a simplified version of the competition that we model as a hybrid system. We use an optimization approach to synthesize control policies by solving mixed integer linear programs.

  • A New Method for Solving Bimatrix Games Problems

    We present a new method for solving bimatrix games problems. Firstly, bimatrix games problem is transformed into general linear complementarity problem. Then we apply mixed integer linear programming method to linear complementarity problem. At last, we give some numerical examples to indicate that the method is feasible and effective to bimatrix games problems.

  • MILP Formulations for Generator Maintenance Scheduling in Hydropower Systems

    Maintenance activities help prevent costly generator breakdowns but because generators under maintenance are typically unavailable, the impact of maintenance schedules is significant and their cost must be accounted for when planning maintenance. In this paper, we address the generator maintenance scheduling problem in hydropower systems. We propose a mixed-integer programming model that considers the time windows of the maintenance activities, as well as the nonlinearities and disjunctions of the hydroelectric production functions. Because the resulting model is hard to solve, we also propose an extended formulation, a set reduction approach that uses logical conditions for excluding unnecessary set elements from the model, and valid inequalities. We performed computational experiments using a variety of instances adapted from a real hydropower system in Canada, and the extended formulation with set reduction achieved the best results in terms of computational time and optimality gap.

  • Optimal Power Flow Computations With a Limited Number of Controls Allowed to Move

    This letter focuses on optimal power flow (OPF) computations in which no more than a pre-specified number of controls are allowed to move. To determine an efficient subset of controls satisfying this constraint, we rely on the solution of a mixed integer linear programming (MILP) problem fed with sensitivity information of controls' impact on the objective and constraints. We illustrate this approach on a 60-bus system and for the OPF problem of minimum load curtailment cost to remove thermal congestion.

  • A practical mixed integer linear programming based approach for unit commitment

    This paper presents a practical mixed integer linear programming (MILP) based approach for unit commitment (UC), which is suitable for both traditional and deregulated environments. In general, the UC problem is complicated large- scale, combinatorial, and non-convex in nature, it is very difficult to solve by conventional approaches to achieve both solution accuracy and efficiency. With the recent development of solution techniques, there is a trend to tackle the UC problem by using MILP approaches. In this paper the authors propose a detailed procedure to formulate the UC problem in MILP manners. The problems are then solved via a state-of-the-art optimization package. The usefulness of the proposed solution technique is illustrated by testing the problem with actual system data. The solution obtained not only gives the unit on/off states and MW schedules, but also provides marginal price information associated with system constraints such as load demand requirement to assist strategic bidding in the power market.

  • System-on-Chip design using intellectual properties with imprecise design costs

    This paper presents an IP-based System-on-Chip (SoC) synthesis framework focusing on how to select intellectual properties (IP's) from different sources and how to integrate the selected IP's using on-chip buses. In order to synthesize an on-chip bus-based SoC architecture using IP's with imprecise design costs, we propose a possibilistic mixed integer linear programming (PMILP) model, which is converted into an equivalent mixed integer linear programming (MILP) model without increasing the computational complexity. Experimental results on an MP3 decoding system show that the IP-centric design space with uncertainty can be successfully explored using the proposed scheme.

  • Minimizing total tardiness on a single machine with sequence-dependent setup times

    In this paper, we study the single machine scheduling problem with setup times for minimizing total tardiness. Such a problem is NP-hard and presents many difficulties to be solved. To reduce these difficulties, we propose a branch and bound algorithm. Our method is based on a new lower bound and is compared with Ragatz lower bound. New dominance rule and original exploration strategy are also proposed. Preliminary numerical simulations are encouraging and promising.



Standards related to Integer linear programming

Back to Top

(Replaced) IEEE Standard VHDL Language Reference Manual

his standard revises and enhances the VHDL language reference manual (LRM) by including a standard C language interface specification; specifications from previously separate, but related, standards IEEE Std 1164 -1993,1 IEEE Std 1076.2 -1996, and IEEE Std 1076.3-1997; and general language enhancements in the areas of design and verification of electronic systems.



Jobs related to Integer linear programming

Back to Top